Base | Representation |
---|---|
bin | 1001000110001100110011… |
… | …0100100111011001011010 |
3 | 1022102012012221210002012001 |
4 | 2101203030310213121122 |
5 | 2302333320233210020 |
6 | 33134524404311214 |
7 | 2051425602003505 |
oct | 221431464473132 |
9 | 38365187702161 |
10 | 10002120210010 |
11 | 320696a1161a5 |
12 | 11565899a250a |
13 | 5772714a1266 |
14 | 26816895a13c |
15 | 1252a114d50a |
hex | 918ccd2765a |
10002120210010 has 8 divisors (see below), whose sum is σ = 18003816378036. Its totient is φ = 4000848084000.
The previous prime is 10002120209981. The next prime is 10002120210029. The reversal of 10002120210010 is 1001202120001.
It can be written as a sum of positive squares in 2 ways, for example, as 8590778586009 + 1411341624001 = 2931003^2 + 1187999^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 1000212021001 = 10002120210010 / (1 + 0 + 0 + 0 + 2 + 1 + 2 + 0 + 2 + 1 + 0 + 0 + 1 + 0).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 500106010491 + ... + 500106010510.
Almost surely, 210002120210010 is an apocalyptic number.
10002120210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10002120210010 is a deficient number, since it is larger than the sum of its proper divisors (8001696168026).
10002120210010 is a wasteful number, since it uses less digits than its factorization.
10002120210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000212021008.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10002120210010 its reverse (1001202120001), we get a palindrome (11003322330011).
The spelling of 10002120210010 in words is "ten trillion, two billion, one hundred twenty million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •