Base | Representation |
---|---|
bin | 1001001001101000001010… |
… | …1000010010000100110001 |
3 | 1022121211012201220121101220 |
4 | 2102122002220102010301 |
5 | 2304314414240130410 |
6 | 33221543434015253 |
7 | 2055612040340115 |
oct | 222320250220461 |
9 | 38554181817356 |
10 | 10061005005105 |
11 | 322993704330a |
12 | 1165a82277529 |
13 | 57c996b85a92 |
14 | 26ad53273745 |
15 | 126a9aa15070 |
hex | 92682a12131 |
10061005005105 has 32 divisors (see below), whose sum is σ = 16160859887616. Its totient is φ = 5344800333504.
The previous prime is 10061005005101. The next prime is 10061005005109. The reversal of 10061005005105 is 50150050016001.
It is an interprime number because it is at equal distance from previous prime (10061005005101) and next prime (10061005005109).
It is not a de Polignac number, because 10061005005105 - 22 = 10061005005101 is a prime.
It is a super-2 number, since 2×100610050051052 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10061005005101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10329034 + ... + 11261036.
It is an arithmetic number, because the mean of its divisors is an integer number (505026871488).
Almost surely, 210061005005105 is an apocalyptic number.
10061005005105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10061005005105 is a deficient number, since it is larger than the sum of its proper divisors (6099854882511).
10061005005105 is a wasteful number, since it uses less digits than its factorization.
10061005005105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934837.
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 10061005005105 in words is "ten trillion, sixty-one billion, five million, five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •