Base | Representation |
---|---|
bin | 1010000110000110111110… |
… | …00000110010100101100101 |
3 | 2220121022102101221100112211 |
4 | 11003003133000302211211 |
5 | 10402211332410341401 |
6 | 115114333341243421 |
7 | 4450622656556425 |
oct | 503033700624545 |
9 | 86538371840484 |
10 | 22200132512101 |
11 | 708a029057355 |
12 | 25a664b563571 |
13 | c506044522ab |
14 | 56a6c6644485 |
15 | 287722c60951 |
hex | 1430df032965 |
22200132512101 has 2 divisors, whose sum is σ = 22200132512102. Its totient is φ = 22200132512100.
The previous prime is 22200132512087. The next prime is 22200132512177. The reversal of 22200132512101 is 10121523100222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21248863903201 + 951268608900 = 4609649^2 + 975330^2 .
It is a cyclic number.
It is not a de Polignac number, because 22200132512101 - 215 = 22200132479333 is a prime.
It is a super-2 number, since 2×222001325121012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22200132512501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100066256050 + 11100066256051.
It is an arithmetic number, because the mean of its divisors is an integer number (11100066256051).
Almost surely, 222200132512101 is an apocalyptic number.
It is an amenable number.
22200132512101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22200132512101 is an equidigital number, since it uses as much as digits as its factorization.
22200132512101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 22200132512101 its reverse (10121523100222), we get a palindrome (32321655612323).
The spelling of 22200132512101 in words is "twenty-two trillion, two hundred billion, one hundred thirty-two million, five hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •