Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1111000010010100101011 |
3 | 1022211120002001000211010001 |
4 | 2103101322233002110223 |
5 | 2311310303014200021 |
6 | 33305305120003431 |
7 | 2063134603255135 |
oct | 223217257022453 |
9 | 38746061024101 |
10 | 10121002100011 |
11 | 3252324916770 |
12 | 1175627160577 |
13 | 585538b3687a |
14 | 26dc055ac055 |
15 | 12840cd92091 |
hex | 9347abc252b |
10121002100011 has 32 divisors (see below), whose sum is σ = 11398346707968. Its totient is φ = 8907698365440.
The previous prime is 10121002099987. The next prime is 10121002100039. The reversal of 10121002100011 is 11000120012101.
10121002100011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10121002100011 - 211 = 10121002097963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10121002100051) 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, 37093761 + ... + 37365613.
It is an arithmetic number, because the mean of its divisors is an integer number (356198334624).
Almost surely, 210121002100011 is an apocalyptic number.
10121002100011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10121002100011 is a deficient number, since it is larger than the sum of its proper divisors (1277344607957).
10121002100011 is a wasteful number, since it uses less digits than its factorization.
10121002100011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272691.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10121002100011 its reverse (11000120012101), we get a palindrome (21121122112112).
The spelling of 10121002100011 in words is "ten trillion, one hundred twenty-one billion, two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •