Base | Representation |
---|---|
bin | 1001100110011100100100… |
… | …10111111100011010101101 |
3 | 2202202022022220122002221021 |
4 | 10303032102113330122231 |
5 | 10231400311310311112 |
6 | 112522453040534141 |
7 | 4306210331101123 |
oct | 463162227743255 |
9 | 82668286562837 |
10 | 21112220010157 |
11 | 67aa70788a581 |
12 | 244b833921351 |
13 | ba1b48995a43 |
14 | 52dba0653913 |
15 | 26929d565907 |
hex | 1333925fc6ad |
21112220010157 has 2 divisors, whose sum is σ = 21112220010158. Its totient is φ = 21112220010156.
The previous prime is 21112220010083. The next prime is 21112220010179. The reversal of 21112220010157 is 75101002221112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18877452142761 + 2234767867396 = 4344819^2 + 1494914^2 .
It is a cyclic number.
It is not a de Polignac number, because 21112220010157 - 27 = 21112220010029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21112220310157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10556110005078 + 10556110005079.
It is an arithmetic number, because the mean of its divisors is an integer number (10556110005079).
Almost surely, 221112220010157 is an apocalyptic number.
It is an amenable number.
21112220010157 is a deficient number, since it is larger than the sum of its proper divisors (1).
21112220010157 is an equidigital number, since it uses as much as digits as its factorization.
21112220010157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 21112220010157 its reverse (75101002221112), we get a palindrome (96213222231269).
The spelling of 21112220010157 in words is "twenty-one trillion, one hundred twelve billion, two hundred twenty million, ten thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •