Base | Representation |
---|---|
bin | 110000001101000011010011… |
… | …011100001001000001011111 |
3 | 1000210122022010212012010202022 |
4 | 300031003103130021001133 |
5 | 210241424404033201002 |
6 | 2030520521140450355 |
7 | 62440502162254655 |
oct | 6015032334110137 |
9 | 1023568125163668 |
10 | 212003133100127 |
11 | 616070297a76a6 |
12 | 1b93b7643a99bb |
13 | 913aa6aac5865 |
14 | 3a4d013774dd5 |
15 | 1979a4c095ba2 |
hex | c0d0d370905f |
212003133100127 has 2 divisors, whose sum is σ = 212003133100128. Its totient is φ = 212003133100126.
The previous prime is 212003133100019. The next prime is 212003133100163. The reversal of 212003133100127 is 721001331300212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212003133100127 - 220 = 212003132051551 is a prime.
It is a super-2 number, since 2×2120031331001272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212003133100096 and 212003133100105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212003133108127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106001566550063 + 106001566550064.
It is an arithmetic number, because the mean of its divisors is an integer number (106001566550064).
Almost surely, 2212003133100127 is an apocalyptic number.
212003133100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
212003133100127 is an equidigital number, since it uses as much as digits as its factorization.
212003133100127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 212003133100127 its reverse (721001331300212), we get a palindrome (933004464400339).
The spelling of 212003133100127 in words is "two hundred twelve trillion, three billion, one hundred thirty-three million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •