Base | Representation |
---|---|
bin | 111000111001111000… |
… | …0001101011100101001 |
3 | 102200102101221011222020 |
4 | 1301303300031130221 |
5 | 4000231440231441 |
6 | 132045521415053 |
7 | 11554154141520 |
oct | 1616360153451 |
9 | 380371834866 |
10 | 122201102121 |
11 | 4790937778a |
12 | 1b824a9a489 |
13 | b6a6213567 |
14 | 5cb37cd4b7 |
15 | 32a333de66 |
hex | 1c73c0d729 |
122201102121 has 8 divisors (see below), whose sum is σ = 186211203264. Its totient is φ = 69829201200.
The previous prime is 122201102087. The next prime is 122201102129. The reversal of 122201102121 is 121201102221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122201102121 - 210 = 122201101097 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 122201102121.
It is not an unprimeable number, because it can be changed into a prime (122201102129) 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, 2909550030 + ... + 2909550071.
It is an arithmetic number, because the mean of its divisors is an integer number (23276400408).
Almost surely, 2122201102121 is an apocalyptic number.
It is an amenable number.
122201102121 is a deficient number, since it is larger than the sum of its proper divisors (64010101143).
122201102121 is an equidigital number, since it uses as much as digits as its factorization.
122201102121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5819100111.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122201102121 its reverse (121201102221), we get a palindrome (243402204342).
The spelling of 122201102121 in words is "one hundred twenty-two billion, two hundred one million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •