Base | Representation |
---|---|
bin | 11101011101001011110… |
… | …11010011001001011001 |
3 | 10120202102001210000010102 |
4 | 32232211323103021121 |
5 | 113040240340200441 |
6 | 2052541451025145 |
7 | 133056544256216 |
oct | 16564573231131 |
9 | 3522361700112 |
10 | 1012101100121 |
11 | 36025875a591 |
12 | 14419a73b1b5 |
13 | 7459636a807 |
14 | 36db3660b0d |
15 | 1b4d8d0769b |
hex | eba5ed3259 |
1012101100121 has 2 divisors, whose sum is σ = 1012101100122. Its totient is φ = 1012101100120.
The previous prime is 1012101100091. The next prime is 1012101100133. The reversal of 1012101100121 is 1210011012101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 978494877721 + 33606222400 = 989189^2 + 183320^2 .
It is a cyclic number.
It is not a de Polignac number, because 1012101100121 - 214 = 1012101083737 is a prime.
It is a super-2 number, since 2×10121011001212 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1012101160121) 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, 506050550060 + 506050550061.
It is an arithmetic number, because the mean of its divisors is an integer number (506050550061).
Almost surely, 21012101100121 is an apocalyptic number.
It is an amenable number.
1012101100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012101100121 is an equidigital number, since it uses as much as digits as its factorization.
1012101100121 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 1012101100121 its reverse (1210011012101), we get a palindrome (2222112112222).
The spelling of 1012101100121 in words is "one trillion, twelve billion, one hundred one million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •