Base | Representation |
---|---|
bin | 1001001000100010000000… |
… | …1111111011110000000001 |
3 | 1022120000121102011012022210 |
4 | 2102020200033323300001 |
5 | 2304012333143221412 |
6 | 33205151124452333 |
7 | 2054344306405461 |
oct | 222104017736001 |
9 | 38500542135283 |
10 | 10042174585857 |
11 | 3221953833657 |
12 | 11622a7b4a0a9 |
13 | 57ac858b187b |
14 | 26a08843dba1 |
15 | 1263477c683c |
hex | 922203fbc01 |
10042174585857 has 8 divisors (see below), whose sum is σ = 13540010677920. Its totient is φ = 6619560775520.
The previous prime is 10042174585841. The next prime is 10042174585871. The reversal of 10042174585857 is 75858547124001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10042174585857 - 24 = 10042174585841 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10042174585797 and 10042174585806.
It is not an unprimeable number, because it can be changed into a prime (10042174585757) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18805570119 + ... + 18805570652.
It is an arithmetic number, because the mean of its divisors is an integer number (1692501334740).
Almost surely, 210042174585857 is an apocalyptic number.
It is an amenable number.
10042174585857 is a deficient number, since it is larger than the sum of its proper divisors (3497836092063).
10042174585857 is an equidigital number, since it uses as much as digits as its factorization.
10042174585857 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37611140863.
The product of its (nonzero) digits is 12544000, while the sum is 57.
The spelling of 10042174585857 in words is "ten trillion, forty-two billion, one hundred seventy-four million, five hundred eighty-five thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •