A031347 -id:A031347 - cp's OEIS frontend

A263479 Total number of n-digit positive integers with multiplicative digital root value 5.

1, 6, 33, 132, 435, 1466, 5341, 18656, 58029, 159430, 392601, 882036, 1836159, 3586506, 6638885, 11738656, 19952441, 32768742, 52220113, 81029700, 122785131, 182142906, 265066605, 379102400, 533695525, 740551526, 1014046281, 1371688948, 1834642167, 2428304010

Offset: 1

Martin Renner, Oct 19 2015

First differences of A263473.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A031347, A034052, A263473.

Last /@ Tally@ IntegerLength@ Select[Range@ 1000000, FixedPoint[Times @@ IntegerDigits@ # &, #] == 5 &] (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=10^(n-1), 10^n - 1, if(t(i) == 5, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263476(n) + A000012(n) + A263477(n) + A000027(n) + A263478(n) + a(n) + A263480(n) + A000027(n) + A263481(n) + A000217(n) = A052268(n).
a(n) = (1/720)*(3*n^8 + 6*n^7 - 664*n^6 + 6270*n^5 - 25783*n^4 + 55164*n^3 - 57796*n^2 + 23520*n). - Sergio Pimentel, Mar 27 2024
From Chai Wah Wu, Apr 17 2024: (Start)
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9) for n > 9.
G.f.: x*(235*x^7 - 205*x^6 - 161*x^5 - 57*x^4 + 33*x^3 - 15*x^2 + 3*x - 1)/(x - 1)^9. (End)

a(9)-a(30) from Hiroaki Yamanouchi, Oct 25 2015

A350181 Numbers of multiplicative persistence 2 which are themselves the product of digits of a number.

Original entry on oeis.org

25, 27, 28, 35, 36, 45, 48, 54, 56, 63, 64, 72, 84, 125, 126, 128, 135, 144, 162, 192, 216, 224, 225, 243, 245, 252, 256, 315, 324, 375, 432, 441, 512, 525, 567, 576, 588, 625, 675, 735, 756, 875, 945, 1125, 1134, 1152, 1176, 1215, 1225, 1296, 1323, 1372

Offset: 1

Daniel Mondot, Dec 18 2021

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 3.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for this and subsequent sequences A350182....
Equivalently:
This sequence consists of the numbers A007954(k) such that A031346(k) = 3,
These are the numbers k in A002473 such that A031346(k) = 2,
Or:
- they factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 2 steps.
Postulated to be finite and complete.
The largest known number is 2^25 * 3^227 * 7^28 (140 digits).
No more numbers have been found between 10^140 and probably 10^20000 (according to comment in A003001), and independently verified up to 10^10000.

			25 is in this sequence because:
- 25 goes to a single digit in 2 steps: p(25) = 10, p(10) = 0.
- 25 has ancestors 55, 155, etc. p(55) = 25.
27 is in this sequence because:
- 27 goes to a single digit in 2 steps: p(27) = 14, p(14) = 4.
- 27 has ancestors 39, 93, 333, 139, etc. p(39) = 27.

Daniel Mondot, Table of n, a(n) for n = 1..11994

Cf. A002473, A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046511 (all numbers with mp of 2).

Cf. A350180, A350182, A350183, A350184, A350185, A350186, A350187 (numbers with mp 1, and 3 to 10 that are themselves 7-smooth numbers).

Select[Range@1400,AllTrue[First/@FactorInteger@#,#<10&]&&Length@Most@NestWhileList[Times@@IntegerDigits@#&,#,#>9&]==2&] (* Giorgos Kalogeropoulos, Jan 16 2022 *)

from math import prod
from sympy import factorint
def pd(n): return prod(map(int, str(n)))
def ok(n):
    if n <= 9 or max(factorint(n)) > 9: return False
    return (p := pd(n)) > 9 and pd(p) < 10
print([k for k in range(1400) if ok(k)]) # Michael S. Branicky, Jan 16 2022

A350182 Numbers of multiplicative persistence 3 which are themselves the product of digits of a number.

Original entry on oeis.org

49, 75, 96, 98, 147, 168, 175, 189, 196, 288, 294, 336, 343, 392, 448, 486, 648, 672, 729, 784, 864, 882, 896, 972, 1344, 1715, 1792, 1944, 2268, 2744, 3136, 3375, 3888, 3969, 7938, 8192, 9375, 11664, 12288, 12348, 13824, 14336, 16384, 16464, 17496, 18144

Offset: 1

Daniel Mondot, Dec 18 2021

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 4.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181....
Equivalently:
This sequence consists of the numbers A007954(k) such that A031346(k) = 4,
These are the numbers k in A002473 such that A031346(k) = 3,
Or:
- they factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 3 steps.
Postulated to be finite and complete.
Let p(n) be the product of all the digits of n.
The multiplicative persistence of a number mp(n) is the number of times you need to apply p() to get to a single digit.
For example:
mp(1) is 0 since 1 is already a single-digit number.
mp(10) is 1 since p(10) = 0, and 0 is a single digit, 1 step.
mp(25) is 2 since p(25) = 10, p(10) = 0, 2 steps.
mp(96) is 3 since p(96) = 54, p(54) = 20, p(20) = 0, 3 steps.
mp(378) is 4 since p(378) = 168, p(168) = 48, p(48) = 32, p(32) = 6, 4 steps.
There are infinitely many numbers n such that mp(n)=4. But for each n with mp(n)=4, p(n) is a number included in this sequence, and this sequence is likely finite.
This sequence lists p(n) such that mp(n) = 4, or mp(p(n)) = 3.

			49 is in this sequence because:
- 49 goes to a single digit in 3 steps: p(49) = 36, p(36) = 18, p(18) = 8.
- p(77) = p(177) = p(717) = p(771) = 49, etc.
75 is in this sequence because:
- 75 goes to a single digit in 3 steps: p(75) = 35, p(35) = 15, p(15) = 5.
- p(355) = p(535) = p(1553) = 75, etc.

Daniel Mondot, Table of n, a(n) for n = 1..387
Eric Weisstein's World of Mathematics, Multiplicative Persistence
Multiplicative Persistence Tree

Cf. A002473, A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046512 (all numbers with mp of 3).

Cf. A350180, A350181, A350183, A350184, A350185, A350186, A350187 (numbers with mp 0, 1 and 3 to 10 that are themselves 7-smooth numbers).

A350183 Numbers of multiplicative persistence 4 which are themselves the product of digits of a number.

Original entry on oeis.org

378, 384, 686, 768, 1575, 1764, 2646, 4374, 6144, 6174, 6272, 7168, 8232, 8748, 16128, 21168, 23328, 27216, 28672, 32928, 34992, 49392, 59535, 67228, 77175, 96768, 112896, 139968, 148176, 163296, 214326, 236196, 393216, 642978, 691488, 774144, 777924

Offset: 1

Daniel Mondot, Dec 18 2021

The multiplicative persistence of a number mp(n) is the number of times the product-of-digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product-of-digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 5.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181....
Equivalently:
- This sequence lists all numbers A007954(k) such that A031346(k) = 5.
- These are the numbers k in A002473 such that A031346(k) = 4.
Or:
- These numbers factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 4 steps.
Postulated to be finite and complete.

			384 is in this sequence because:
- 384 goes to a single digit in 4 steps: p(384)=96, p(96)=54, p(54)=20, p(20)=0.
- p(886)=384, p(6248)=384, p(18816)=384, etc.
378 is in this sequence because:
- 378 goes to a single digits in 4 steps: p(378)=168, p(168)=48, p(48)=32, p(32)=6.
- p(679)=378, p(2397)=378, p(12379)=378, etc.

Daniel Mondot, Table of n, a(n) for n = 1..142
Eric Weisstein's World of Mathematics, Multiplicative Persistence
Daniel Mondot, Multiplicative Persistence Tree

Cf. A002473 (7-smooth), A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046513 (all numbers with mp of 4).

Cf. A350180, A350181, A350182, A350184, A350185, A350186, A350187 (numbers with mp 1 to 3 and 5 to 10 that are themselves 7-smooth numbers).

mx=10^6;lst=Sort@Flatten@Table[2^i*3^j*5^k*7^l,{i,0,Log[2,mx]},{j,0,Log[3,mx/2^i]},{k,0,Log[5,mx/(2^i*3^j)]},{l,0,Log[7,mx/(2^i*3^j*5^k)]}]; (* from A002473 *)
Select[lst,Length@Most@NestWhileList[Times@@IntegerDigits@#&,#,#>9&]==4&] (* Giorgos Kalogeropoulos, Jan 16 2022 *)

pd(n) = if (n, vecprod(digits(n)), 0); \\ A007954
mp(n) = my(k=n, i=0); while(#Str(k) > 1, k=pd(k); i++); i; \\ A031346
isok(k) = (mp(k)==4) && (vecmax(factor(k)[,1]) <= 7); \\ Michel Marcus, Jan 25 2022

from math import prod
from sympy import factorint
def pd(n): return prod(map(int, str(n)))
def ok(n):
    if n <= 9 or max(factorint(n)) > 9: return False
    return (p := pd(n)) > 9 and (q := pd(p)) > 9 and (r := pd(q)) > 9 and pd(r) < 10
print([k for k in range(778000) if ok(k)])

A350184 Numbers of multiplicative persistence 5 which are themselves the product of digits of a number.

Original entry on oeis.org

2688, 18816, 26244, 98784, 222264, 262144, 331776, 333396, 666792, 688128, 1769472, 2939328, 3687936, 4214784, 4917248, 13226976, 19361664, 38118276, 71663616, 111476736, 133413966, 161414428, 169869312, 184473632, 267846264, 368947264, 476171136, 1783627776

Offset: 1

Daniel Mondot, Dec 18 2021

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 5.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181....
Equivalently:
This sequence consists of all numbers A007954(k) such that A031346(k) = 6.
These are the numbers k in A002473 such that A031346(k) = 5.
Or:
- they factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 5 steps.
Postulated to be finite and complete.

			2688 is in this sequence because:
- 2688 goes to a single digit in 5 steps: p(2688)=768, p(768)=336, p(336)=54, p(54)=20, p(20)=0.
- p(27648) = p(47628) = 2688, etc.
331776 is in this sequence because:
- 331776 goes to a single digit in 5 steps: p(331776)=2646, p(2646)=288, p(288)=128, p(128)=16, p(16)=6.
- p(914838624) = p(888899) = 331776, etc.

Daniel Mondot, Table of n, a(n) for n = 1..41
Daniel Mondot, Multiplicative Persistence Tree
Eric Weisstein's World of Mathematics, Multiplicative Persistence

Intersection of A002473 and A046514 (all numbers with mp of 5).
Cf. A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root).
Cf. A350180, A350181, A350182, A350183, A350185, A350186, A350187 (numbers with mp 1 to 4 and 6 to 10 that are themselves 7-smooth numbers).

mx=10^10;lst=Sort@Flatten@Table[2^i*3^j*5^k*7^l,{i,0,Log[2,mx]},{j,0,Log[3,mx/2^i]},{k,0,Log[5,mx/(2^i*3^j)]},{l,0,Log[7,mx/(2^i*3^j*5^k)]}];
Select[lst,Length@Most@NestWhileList[Times@@IntegerDigits@#&,#,#>9&]==5&] (* code for 7-smooth numbers from A002473. - Giorgos Kalogeropoulos, Jan 16 2022 *)

from math import prod
def hd(n):
    while (n&1) == 0:  n >>= 1
    while (n%3) == 0:  n /= 3
    while (n%5) == 0:  n /= 5
    while (n%7) == 0:  n /= 7
    return(n)
def pd(n): return prod(map(int, str(n)))
def ok(n):
    if hd(n) > 9: return False
    return (p := pd(n)) > 9 and (q := pd(p)) > 9 and (r := pd(q)) > 9 and (s := pd(r)) > 9 and pd(s) < 10
print([k for k in range(10,476200000) if ok(k)])

A350185 Numbers of multiplicative persistence 6 which are themselves the product of digits of a number.

Original entry on oeis.org

27648, 47628, 64827, 84672, 134217728, 914838624, 1792336896, 3699376128, 48814981614, 134481277728, 147483721728, 1438916737499136

Offset: 1

Daniel Mondot, Jan 15 2022

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 7.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181....
Equivalently:
This sequence consists of the numbers A007954(k) such that A031346(k) = 7,
These are the numbers k in A002473 such that A031346(k) = 6,
Or:
- they factor into powers of 2, 3, 5 and 7 exclusively.
- p(n) goes to a single digit in 6 steps.
Postulated to be finite and complete.
a(13), if it exists, is > 10^20000, and likely > 10^80000.

			27648 is in sequence because:
- 27648 goes to a single digit in 6 steps: p(27648)=2688, p(2688)=768, p(768)=336, p(336)=54, p(54)=20, p(20)=0.
- p(338688) = p(168889) = 27648, etc.

Daniel Mondot, Multiplicative Persistence Tree

Cf. A002473, A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046515 (all numbers with mp of 6).

Cf. A350180, A350181, A350182, A350183, A350184, A350186, A350187 (numbers with mp 1 to 5 and 7 to 10 that are themselves 7-smooth numbers).

mx=10^16;lst=Sort@Flatten@Table[2^i*3^j*5^k*7^l,{i,0,Log[2,mx]},{j,0,Log[3,mx/2^i]},{k,0,Log[5,mx/(2^i*3^j)]},{l,0,Log[7,mx/(2^i*3^j*5^k)]}];
Select[lst,Length@Most@NestWhileList[Times@@IntegerDigits@#&,#,#>9&]==6&] (* code for 7-smooth numbers from A002473. - Giorgos Kalogeropoulos, Jan 16 2022 *)

#this program may take 91 minutes to produce the first 8 members.
from math import prod
def hd(n):
    while (n&1) == 0:  n >>= 1
    while (n%3) == 0:  n /= 3
    while (n%5) == 0:  n /= 5
    while (n%7) == 0:  n /= 7
    return(n)
def pd(n): return prod(map(int, str(n)))
def ok(n):
    if hd(n) > 9: return False
    return (p := pd(n)) > 9 and (q := pd(p)) > 9 and (r := pd(q)) > 9 and (s := pd(r)) > 9 and (t := pd(s)) > 9 and pd(t) < 10
print([k for k in range(10,3700000000) if ok(k)])

A350187 Numbers of multiplicative persistence 8 which are themselves the product of digits of a number.

Original entry on oeis.org

4478976, 784147392, 19421724672, 249143169618, 717233481216

Offset: 1

Daniel Mondot, Jan 30 2022

The multiplicative persistence of a number mp(n) is the number of times the product of digits function p(n) must be applied to reach a single digit, i.e., A031346(n).
The product of digits function partitions all numbers into equivalence classes. There is a one-to-one correspondence between values in this sequence and equivalence classes of numbers with multiplicative persistence 9.
There are infinitely many numbers with mp of 1 to 11, but the classes of numbers (p(n)) are postulated to be finite for sequences A350181.
Equivalently:
This sequence consists of all numbers A007954(k) such that A031346(k) = 9.
They are the numbers k in A002473 such that A031346(k) = 8.
Or they factor into powers of 2, 3, 5 and 7 exclusively and p(n) goes to a single digit in 8 steps.
Postulated to be finite and complete.
a(6), if it exists, is > 10^20000, and likely > 10^171000.

			4478976 is in this sequence because:
- 4478976 goes to a single digit in 8 steps: 4478976 -> 338688 -> 27648 -> 2688 -> 768 -> 336 -> 54 -> 20 -> 0;
- p(438939648) = p(231928233984) = 4478976.

Daniel Mondot, Multiplicative Persistence Tree
Eric Weisstein's World of Mathematics, Multiplicative Persistence

Intersection of A002473 and A046517.
Cf. A003001 (smallest number with multiplicative persistence n), A031346 (multiplicative persistence), A031347 (multiplicative digital root), A046517 (all numbers with mp of 8).
Cf. A350180, A350181, A350182, A350183, A350184, A350185, A350186 (numbers with mp 1 to 7 and 9 to 10 that are themselves 7-smooth numbers).

A263470 Total number of positive integers < 10^n with multiplicative digital root value 0.

Original entry on oeis.org

0, 24, 476, 6739, 82401, 902608, 9394517, 96122290, 975700392, 9854082822, 99180099587, 995679223590, 9977627937023, 99879659224379, 999321444658475, 9996118748668338, 99978099721506172, 999879067589400315, 9999346524827012003, 99996542810942397874

Offset: 1

Martin Renner, Oct 19 2015

Partial sums of A263476. - Michel Marcus, Oct 22 2015

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50
Eric Weisstein's World of Mathematics, Multiplicative Digital Root.

Cf. A031347, A034048, A263476.

Length@ Select[Range[10^# - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 0 &] & /@ Range@ 6 (* Michael De Vlieger, Oct 19 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=1, 10^n - 1, if(t(i) == 0, 1, 0)); \\ Altug Alkan, Oct 19 2015

a(n) + A000027(n) + A263471(n) + A000217(n) + A263472(n) + A263473(n) + A263474(n) + A000217(n) + A263475(n) + A000292(n) = A002283(n).

a(9)-a(20) from Hiroaki Yamanouchi, Oct 25 2015

A263471 Total number of positive integers < 10^n with multiplicative digital root value 2.

Original entry on oeis.org

1, 9, 77, 543, 3213, 16673, 86093, 503815, 3529057, 25402097, 162303510, 884504882, 4156234265, 17270407962, 65375131342, 232901619970, 807191392546, 2795912956450, 9796747697594, 34556445906044, 120898966116007, 413105921852769, 1363586516014222

Offset: 1

Martin Renner, Oct 19 2015

Partial sums of A263477.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50
Eric Weisstein's World of Mathematics, Multiplicative Digital Root

Cf. A031347, A034049, A051822, A263477.

Length@ Select[Range[10^# - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 2 &] & /@ Range@ 6 (* Michael De Vlieger, Oct 19 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=1, 10^n - 1, if(t(i) == 2, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263470(n) + A000027(n) + a(n) + A000217(n) + A263472(n) + A263473(n) + A263474(n) + A000217(n) + A263475(n) + A000292(n) = A002283(n).

a(8) from Michael De Vlieger, Oct 19 2015

a(9)-a(23) from Hiroaki Yamanouchi, Oct 25 2015

A263472 Total number of positive integers < 10^n with multiplicative digital root value 4.

Original entry on oeis.org

1, 10, 65, 279, 894, 2345, 6174, 66354, 1005399, 9737884, 66699415, 356586629, 1585685916, 6342292785, 30560724590, 264486626166, 2926013859615, 28611339267816, 232062904906327, 1588966488941437, 9421788721876388, 49444241961339027, 233673191793220620

Offset: 1

Martin Renner, Oct 19 2015

Partial sums of A263478.

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..50

Cf. A031347, A034051, A263478.

lim = 6; t = Select[Range[1, 10^lim - 1], FixedPoint[Times @@ IntegerDigits@ # &, #] == 4 &]; Count[t, n_ /; n <= 10^#] & /@ Range@ lim (* Michael De Vlieger, Oct 21 2015 *)

t(k) = {while(k>9, k=prod(i=1, #k=digits(k), k[i])); k}
a(n) = sum(i=1, 10^n - 1, if(t(i) == 4, 1, 0)); \\ Altug Alkan, Oct 19 2015

A263470(n) + A000027(n) + A263471(n) + A000217(n) + a(n) + A263473(n) + A263474(n) + A000217(n) + A263475(n) + A000292(n) = A002283(n).

a(9)-a(23) from Hiroaki Yamanouchi, Oct 25 2015

cp's OEIS Frontend

A263479 Total number of n-digit positive integers with multiplicative digital root value 5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A350181 Numbers of multiplicative persistence 2 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A350182 Numbers of multiplicative persistence 3 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A350183 Numbers of multiplicative persistence 4 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

A350184 Numbers of multiplicative persistence 5 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A350185 Numbers of multiplicative persistence 6 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A350187 Numbers of multiplicative persistence 8 which are themselves the product of digits of a number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A263470 Total number of positive integers < 10^n with multiplicative digital root value 0.

Views

Author

Keywords

Comments

Links