Base | Representation |
---|---|
bin | 1001101001010100111100… |
… | …01010010001110011101101 |
3 | 2210002202211010201021201222 |
4 | 10310222132022101303231 |
5 | 10240011020203032112 |
6 | 113040143000313125 |
7 | 4316313234124226 |
oct | 464523612216355 |
9 | 83082733637658 |
10 | 21211202002157 |
11 | 6838690612152 |
12 | 2466a587727a5 |
13 | bab29160178b |
14 | 5348b03da24d |
15 | 26bb43213372 |
hex | 134a9e291ced |
21211202002157 has 2 divisors, whose sum is σ = 21211202002158. Its totient is φ = 21211202002156.
The previous prime is 21211202002063. The next prime is 21211202002169. The reversal of 21211202002157 is 75120020211212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18172947324676 + 3038254677481 = 4262974^2 + 1743059^2 .
It is a cyclic number.
It is not a de Polignac number, because 21211202002157 - 218 = 21211201740013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21211202002357) 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, 10605601001078 + 10605601001079.
It is an arithmetic number, because the mean of its divisors is an integer number (10605601001079).
Almost surely, 221211202002157 is an apocalyptic number.
It is an amenable number.
21211202002157 is a deficient number, since it is larger than the sum of its proper divisors (1).
21211202002157 is an equidigital number, since it uses as much as digits as its factorization.
21211202002157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 21211202002157 its reverse (75120020211212), we get a palindrome (96331222213369).
The spelling of 21211202002157 in words is "twenty-one trillion, two hundred eleven billion, two hundred two million, two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •