Base | Representation |
---|---|
bin | 1011000000010100011101… |
… | …1110010110010101111001 |
3 | 1120211202112022022020200010 |
4 | 2300011013132112111321 |
5 | 3041222022213323001 |
6 | 41422415212132133 |
7 | 2356130206036143 |
oct | 260050736262571 |
9 | 46752468266603 |
10 | 12100122011001 |
11 | 39456a6475642 |
12 | 1435102467049 |
13 | 69a06257b68b |
14 | 2db912d1dc93 |
15 | 15eb42c0b8d6 |
hex | b0147796579 |
12100122011001 has 32 divisors (see below), whose sum is σ = 16288452222976. Its totient is φ = 7989597000000.
The previous prime is 12100122010919. The next prime is 12100122011101. The reversal of 12100122011001 is 10011022100121.
12100122011001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12100122011001 - 29 = 12100122010489 is a prime.
It is a super-2 number, since 2×121001220110012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12100122011101) 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, 1222106151 + ... + 1222116051.
It is an arithmetic number, because the mean of its divisors is an integer number (509014131968).
Almost surely, 212100122011001 is an apocalyptic number.
It is an amenable number.
12100122011001 is a deficient number, since it is larger than the sum of its proper divisors (4188330211975).
12100122011001 is a wasteful number, since it uses less digits than its factorization.
12100122011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17773.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 12100122011001 its reverse (10011022100121), we get a palindrome (22111144111122).
The spelling of 12100122011001 in words is "twelve trillion, one hundred billion, one hundred twenty-two million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •