Base | Representation |
---|---|
bin | 1001001101000111101010… |
… | …1010111000101100101011 |
3 | 1022211120001221222112122202 |
4 | 2103101322222320230223 |
5 | 2311310302224341021 |
6 | 33305305040410415 |
7 | 2063134561104131 |
oct | 223217252705453 |
9 | 38746057875582 |
10 | 10121001012011 |
11 | 325232424329a |
12 | 1175626916a0b |
13 | 585538845596 |
14 | 26dc053a7751 |
15 | 12840cc29a0b |
hex | 9347aab8b2b |
10121001012011 has 2 divisors, whose sum is σ = 10121001012012. Its totient is φ = 10121001012010.
The previous prime is 10121001011983. The next prime is 10121001012077. The reversal of 10121001012011 is 11021010012101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10121001012011 - 222 = 10120996817707 is a prime.
It is a super-2 number, since 2×101210010120112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10121001011983 and 10121001012001.
It is not a weakly prime, because it can be changed into another prime (10121001312011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060500506005 + 5060500506006.
It is an arithmetic number, because the mean of its divisors is an integer number (5060500506006).
Almost surely, 210121001012011 is an apocalyptic number.
10121001012011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10121001012011 is an equidigital number, since it uses as much as digits as its factorization.
10121001012011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10121001012011 its reverse (11021010012101), we get a palindrome (21142011024112).
The spelling of 10121001012011 in words is "ten trillion, one hundred twenty-one billion, one million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •