Base | Representation |
---|---|
bin | 11101011101010111111… |
… | …01000000011100110001 |
3 | 10120202200010000222100021 |
4 | 32232223331000130301 |
5 | 113040442231223441 |
6 | 2052555502123441 |
7 | 133062212556403 |
oct | 16565375003461 |
9 | 3522603028307 |
10 | 1012202211121 |
11 | 3602aa83a7a2 |
12 | 144208580581 |
13 | 745b12acbca |
14 | 36dc2c60b73 |
15 | 1b4e2b2b3d1 |
hex | ebabf40731 |
1012202211121 has 2 divisors, whose sum is σ = 1012202211122. Its totient is φ = 1012202211120.
The previous prime is 1012202211107. The next prime is 1012202211149. The reversal of 1012202211121 is 1211122022101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 558660574096 + 453541637025 = 747436^2 + 673455^2 .
It is an emirp because it is prime and its reverse (1211122022101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1012202211121 - 233 = 1003612276529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012202211095 and 1012202211104.
It is not a weakly prime, because it can be changed into another prime (1012202212121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506101105560 + 506101105561.
It is an arithmetic number, because the mean of its divisors is an integer number (506101105561).
Almost surely, 21012202211121 is an apocalyptic number.
It is an amenable number.
1012202211121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012202211121 is an equidigital number, since it uses as much as digits as its factorization.
1012202211121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1012202211121 its reverse (1211122022101), we get a palindrome (2223324233222).
The spelling of 1012202211121 in words is "one trillion, twelve billion, two hundred two million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •