Base | Representation |
---|---|
bin | 1001000110011011010010… |
… | …1100111001001111011101 |
3 | 1022102120021002001021212202 |
4 | 2101212310230321033131 |
5 | 2302414302142000221 |
6 | 33140410414541245 |
7 | 2051624160634142 |
oct | 221466454711735 |
9 | 38376232037782 |
10 | 10006010500061 |
11 | 3208586086744 |
12 | 1157294807825 |
13 | 57774145c634 |
14 | 2684174b23c9 |
15 | 12542c951d0b |
hex | 919b4b393dd |
10006010500061 has 8 divisors (see below), whose sum is σ = 10100598567264. Its totient is φ = 9911442321040.
The previous prime is 10006010500043. The next prime is 10006010500111. The reversal of 10006010500061 is 16000501060001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10006010500061 is a prime.
It is a super-2 number, since 2×100060105000612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10006010550061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3960095 + ... + 5974476.
It is an arithmetic number, because the mean of its divisors is an integer number (1262574820908).
Almost surely, 210006010500061 is an apocalyptic number.
It is an amenable number.
10006010500061 is a deficient number, since it is larger than the sum of its proper divisors (94588067203).
10006010500061 is an equidigital number, since it uses as much as digits as its factorization.
10006010500061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9944091.
The product of its (nonzero) digits is 180, while the sum is 20.
Adding to 10006010500061 its reverse (16000501060001), we get a palindrome (26006511560062).
The spelling of 10006010500061 in words is "ten trillion, six billion, ten million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •