Base | Representation |
---|---|
bin | 1010000110001000111110… |
… | …11010100001100111000101 |
3 | 2220121102012201001211111002 |
4 | 11003010133122201213011 |
5 | 10402221041012001013 |
6 | 115115032500023045 |
7 | 4450661516555336 |
oct | 503043732414705 |
9 | 86542181054432 |
10 | 22201213000133 |
11 | 708a532a54a72 |
12 | 25a68b1391a85 |
13 | c50747260a1b |
14 | 56a789d4428d |
15 | 287787a40358 |
hex | 14311f6a19c5 |
22201213000133 has 2 divisors, whose sum is σ = 22201213000134. Its totient is φ = 22201213000132.
The previous prime is 22201213000121. The next prime is 22201213000163. The reversal of 22201213000133 is 33100031210222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14827913594209 + 7373299405924 = 3850703^2 + 2715382^2 .
It is a cyclic number.
It is not a de Polignac number, because 22201213000133 - 210 = 22201212999109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22201213000163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11100606500066 + 11100606500067.
It is an arithmetic number, because the mean of its divisors is an integer number (11100606500067).
Almost surely, 222201213000133 is an apocalyptic number.
It is an amenable number.
22201213000133 is a deficient number, since it is larger than the sum of its proper divisors (1).
22201213000133 is an equidigital number, since it uses as much as digits as its factorization.
22201213000133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 22201213000133 its reverse (33100031210222), we get a palindrome (55301244210355).
The spelling of 22201213000133 in words is "twenty-two trillion, two hundred one billion, two hundred thirteen million, one hundred thirty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •