Base | Representation |
---|---|
bin | 11011110010001111101000… |
… | …010000101010010011101001 |
3 | 121000200012120220000121121221 |
4 | 123302033220100222103221 |
5 | 112004111110333021301 |
6 | 1111521524332302041 |
7 | 34511442124050205 |
oct | 3362175020522351 |
9 | 530605526017557 |
10 | 122200011220201 |
11 | 35a3380864a092 |
12 | 11857220611921 |
13 | 532554740b285 |
14 | 22267252c1b05 |
15 | e1da81a71da1 |
hex | 6f23e842a4e9 |
122200011220201 has 16 divisors (see below), whose sum is σ = 122510217772800. Its totient is φ = 121890170188800.
The previous prime is 122200011220163. The next prime is 122200011220207. The reversal of 122200011220201 is 102022110002221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 122200011220201 - 27 = 122200011220073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122200011220207) 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 in 15 ways as a sum of consecutive naturals, for example, 7729766985 + ... + 7729782793.
It is an arithmetic number, because the mean of its divisors is an integer number (7656888610800).
Almost surely, 2122200011220201 is an apocalyptic number.
It is an amenable number.
122200011220201 is a deficient number, since it is larger than the sum of its proper divisors (310206552599).
122200011220201 is a wasteful number, since it uses less digits than its factorization.
122200011220201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26160.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122200011220201 its reverse (102022110002221), we get a palindrome (224222121222422).
The spelling of 122200011220201 in words is "one hundred twenty-two trillion, two hundred billion, eleven million, two hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •