Base | Representation |
---|---|
bin | 1010000100000110111100… |
… | …10110101111010111000101 |
3 | 2220100202000110101012021202 |
4 | 11002003132112233113011 |
5 | 10400100102403341401 |
6 | 115023005320152245 |
7 | 4442640526140104 |
oct | 502033626572705 |
9 | 86322013335252 |
10 | 22131402012101 |
11 | 7062969520438 |
12 | 2595269908685 |
13 | c46ca0024195 |
14 | 56724649003b |
15 | 285a4dd1806b |
hex | 1420de5af5c5 |
22131402012101 has 2 divisors, whose sum is σ = 22131402012102. Its totient is φ = 22131402012100.
The previous prime is 22131402012079. The next prime is 22131402012119. The reversal of 22131402012101 is 10121020413122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18136960080001 + 3994441932100 = 4258751^2 + 1998610^2 .
It is a cyclic number.
It is not a de Polignac number, because 22131402012101 - 26 = 22131402012037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22131402512101) 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, 11065701006050 + 11065701006051.
It is an arithmetic number, because the mean of its divisors is an integer number (11065701006051).
Almost surely, 222131402012101 is an apocalyptic number.
It is an amenable number.
22131402012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
22131402012101 is an equidigital number, since it uses as much as digits as its factorization.
22131402012101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 22131402012101 its reverse (10121020413122), we get a palindrome (32252422425223).
The spelling of 22131402012101 in words is "twenty-two trillion, one hundred thirty-one billion, four hundred two million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •