Base | Representation |
---|---|
bin | 1100010101110110010… |
… | …0000001110010110111 |
3 | 202021021020220121210222 |
4 | 3011131210001302313 |
5 | 11433210404420002 |
6 | 241222503204555 |
7 | 21214062545054 |
oct | 3053544016267 |
9 | 667236817728 |
10 | 212023123127 |
11 | 81a115865a2 |
12 | 3511214675b |
13 | 16cbc1bb80a |
14 | a394bdc02b |
15 | 57adc611a2 |
hex | 315d901cb7 |
212023123127 has 2 divisors, whose sum is σ = 212023123128. Its totient is φ = 212023123126.
The previous prime is 212023123099. The next prime is 212023123139. The reversal of 212023123127 is 721321320212.
212023123127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212023123127 - 26 = 212023123063 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212023123096 and 212023123105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212023123177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106011561563 + 106011561564.
It is an arithmetic number, because the mean of its divisors is an integer number (106011561564).
Almost surely, 2212023123127 is an apocalyptic number.
212023123127 is a deficient number, since it is larger than the sum of its proper divisors (1).
212023123127 is an equidigital number, since it uses as much as digits as its factorization.
212023123127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 212023123127 its reverse (721321320212), we get a palindrome (933344443339).
The spelling of 212023123127 in words is "two hundred twelve billion, twenty-three million, one hundred twenty-three thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •