Base | Representation |
---|---|
bin | 111000111010001011… |
… | …0101111010001001001 |
3 | 102200110002221022120022 |
4 | 1301310112233101021 |
5 | 4000242031431441 |
6 | 132050522110225 |
7 | 11554336035551 |
oct | 1616426572111 |
9 | 380402838508 |
10 | 122211202121 |
11 | 47914045a98 |
12 | 1b82834b375 |
13 | b6a833b7a8 |
14 | 5cb4c9c161 |
15 | 32a418684b |
hex | 1c745af449 |
122211202121 has 8 divisors (see below), whose sum is σ = 130238025984. Its totient is φ = 114410486080.
The previous prime is 122211202109. The next prime is 122211202123. The reversal of 122211202121 is 121202112221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122211202121 - 210 = 122211201097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 122211202121.
It is not an unprimeable number, because it can be changed into a prime (122211202123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56525840 + ... + 56528001.
It is an arithmetic number, because the mean of its divisors is an integer number (16279753248).
Almost surely, 2122211202121 is an apocalyptic number.
It is an amenable number.
122211202121 is a deficient number, since it is larger than the sum of its proper divisors (8026823863).
122211202121 is a wasteful number, since it uses less digits than its factorization.
122211202121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113053911.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122211202121 its reverse (121202112221), we get a palindrome (243413314342).
The spelling of 122211202121 in words is "one hundred twenty-two billion, two hundred eleven million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •