Base | Representation |
---|---|
bin | 1001001101001000000111… |
… | …1000011101101101100001 |
3 | 1022211120101101122222102212 |
4 | 2103102001320131231201 |
5 | 2311311024213341001 |
6 | 33305325042051505 |
7 | 2063140560431600 |
oct | 223220170355541 |
9 | 38746341588385 |
10 | 10121122012001 |
11 | 3252386578390 |
12 | 117565b349b95 |
13 | 58555792c700 |
14 | 26dc174a3a37 |
15 | 12841867b7bb |
hex | 93481e1db61 |
10121122012001 has 144 divisors (see below), whose sum is σ = 14789700664128. Its totient is φ = 6822047232000.
The previous prime is 10121122011941. The next prime is 10121122012039. The reversal of 10121122012001 is 10021022112101.
It is not a de Polignac number, because 10121122012001 - 26 = 10121122011937 is a prime.
It is a super-2 number, since 2×101211220120012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10121122012601) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 360797426 + ... + 360825476.
It is an arithmetic number, because the mean of its divisors is an integer number (102706254612).
Almost surely, 210121122012001 is an apocalyptic number.
10121122012001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10121122012001 is a deficient number, since it is larger than the sum of its proper divisors (4668578652127).
10121122012001 is a wasteful number, since it uses less digits than its factorization.
10121122012001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28352 (or 28332 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10121122012001 its reverse (10021022112101), we get a palindrome (20142144124102).
The spelling of 10121122012001 in words is "ten trillion, one hundred twenty-one billion, one hundred twenty-two million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •