Base | Representation |
---|---|
bin | 1001000110101010100010… |
… | …0100101111000101010111 |
3 | 1022102221211012221010101212 |
4 | 2101222220210233011113 |
5 | 2303001142103031012 |
6 | 33142324414012035 |
7 | 2052130442060222 |
oct | 221525044570527 |
9 | 38387735833355 |
10 | 10010102002007 |
11 | 320a295687708 |
12 | 1158036aa701b |
13 | 577c4400a7c3 |
14 | 2686c4a445b9 |
15 | 1255bbc4db22 |
hex | 91aa892f157 |
10010102002007 has 16 divisors (see below), whose sum is σ = 10157081920608. Its totient is φ = 9863393379840.
The previous prime is 10010102001989. The next prime is 10010102002111. The reversal of 10010102002007 is 70020020101001.
It is a cyclic number.
It is not a de Polignac number, because 10010102002007 - 26 = 10010102001943 is a prime.
It is a super-3 number, since 3×100101020020073 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10010102001982 and 10010102002000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010102002207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 333510533 + ... + 333540545.
It is an arithmetic number, because the mean of its divisors is an integer number (634817620038).
Almost surely, 210010102002007 is an apocalyptic number.
10010102002007 is a deficient number, since it is larger than the sum of its proper divisors (146979918601).
10010102002007 is a wasteful number, since it uses less digits than its factorization.
10010102002007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34370.
The product of its (nonzero) digits is 28, while the sum is 14.
Adding to 10010102002007 its reverse (70020020101001), we get a palindrome (80030122103008).
The spelling of 10010102002007 in words is "ten trillion, ten billion, one hundred two million, two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •