Base | Representation |
---|---|
bin | 11011110000110100011100… |
… | …111101101110001111001001 |
3 | 121000022211220001212022101021 |
4 | 123300310130331232033021 |
5 | 112001010110431401301 |
6 | 1111404534023152441 |
7 | 34501405066443316 |
oct | 3360643475561711 |
9 | 530284801768337 |
10 | 122102111200201 |
11 | 359a623a639050 |
12 | 11840259ba5721 |
13 | 53192449b0562 |
14 | 2221ab9103d0d |
15 | e1b251d988a1 |
hex | 6f0d1cf6e3c9 |
122102111200201 has 48 divisors (see below), whose sum is σ = 140096381386752. Its totient is φ = 105527921021600.
The previous prime is 122102111200189. The next prime is 122102111200211. The reversal of 122102111200201 is 102002111201221.
It is not a de Polignac number, because 122102111200201 - 25 = 122102111200169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122102111200211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1292544696 + ... + 1292639158.
It is an arithmetic number, because the mean of its divisors is an integer number (2918674612224).
Almost surely, 2122102111200201 is an apocalyptic number.
122102111200201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122102111200201 is a deficient number, since it is larger than the sum of its proper divisors (17994270186551).
122102111200201 is a wasteful number, since it uses less digits than its factorization.
122102111200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95874 (or 95851 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122102111200201 its reverse (102002111201221), we get a palindrome (224104222401422).
The spelling of 122102111200201 in words is "one hundred twenty-two trillion, one hundred two billion, one hundred eleven million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •