Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …11111000111001001111101 |
3 | 2220121022010202220120211122 |
4 | 11003003120133013021331 |
5 | 10402211121343121112 |
6 | 115114314430400325 |
7 | 4450620160112063 |
oct | 503033037071175 |
9 | 86538122816748 |
10 | 22200023020157 |
11 | 7089a82272444 |
12 | 25a661a9600a5 |
13 | c505b7867268 |
14 | 56a6b5ca2033 |
15 | 287718333872 |
hex | 1430d87c727d |
22200023020157 has 2 divisors, whose sum is σ = 22200023020158. Its totient is φ = 22200023020156.
The previous prime is 22200023020099. The next prime is 22200023020169. The reversal of 22200023020157 is 75102032000222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11589537644281 + 10610485375876 = 3404341^2 + 3257374^2 .
It is a cyclic number.
It is not a de Polignac number, because 22200023020157 - 26 = 22200023020093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22200023050157) 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, 11100011510078 + 11100011510079.
It is an arithmetic number, because the mean of its divisors is an integer number (11100011510079).
Almost surely, 222200023020157 is an apocalyptic number.
It is an amenable number.
22200023020157 is a deficient number, since it is larger than the sum of its proper divisors (1).
22200023020157 is an equidigital number, since it uses as much as digits as its factorization.
22200023020157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 26.
Adding to 22200023020157 its reverse (75102032000222), we get a palindrome (97302055020379).
The spelling of 22200023020157 in words is "twenty-two trillion, two hundred billion, twenty-three million, twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •