Base | Representation |
---|---|
bin | 11101011101010111111… |
… | …00111110100001011111 |
3 | 10120202200010000120112001 |
4 | 32232223330332201133 |
5 | 113040442231000411 |
6 | 2052555502023131 |
7 | 133062212524402 |
oct | 16565374764137 |
9 | 3522603016461 |
10 | 1012202203231 |
11 | 3602aa83487a |
12 | 144208577aa7 |
13 | 745b12a943b |
14 | 36dc2c5bd39 |
15 | 1b4e2b28dc1 |
hex | ebabf3e85f |
1012202203231 has 2 divisors, whose sum is σ = 1012202203232. Its totient is φ = 1012202203230.
The previous prime is 1012202203213. The next prime is 1012202203237. The reversal of 1012202203231 is 1323022022101.
Together with previous prime (1012202203213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1012202203231 - 233 = 1003612268639 is a prime.
It is a super-2 number, since 2×10122022032312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1012202203199 and 1012202203208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1012202203237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506101101615 + 506101101616.
It is an arithmetic number, because the mean of its divisors is an integer number (506101101616).
Almost surely, 21012202203231 is an apocalyptic number.
1012202203231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1012202203231 is an equidigital number, since it uses as much as digits as its factorization.
1012202203231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1012202203231 its reverse (1323022022101), we get a palindrome (2335224225332).
The spelling of 1012202203231 in words is "one trillion, twelve billion, two hundred two million, two hundred three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •