Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0111000110011111001 |
3 | 102200012010120201021212 |
4 | 1301232120320303321 |
5 | 4000040420232301 |
6 | 132032544412505 |
7 | 11552012146214 |
oct | 1615630706371 |
9 | 380163521255 |
10 | 122111102201 |
11 | 47872596490 |
12 | 1b7ba917135 |
13 | b69069167a |
14 | 5ca588277b |
15 | 329a4b24bb |
hex | 1c6e638cf9 |
122111102201 has 8 divisors (see below), whose sum is σ = 133278180384. Its totient is φ = 110955035520.
The previous prime is 122111102189. The next prime is 122111102207. The reversal of 122111102201 is 102201111221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122111102201 is a prime.
It is a super-2 number, since 2×1221111022012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122111102207) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2729675 + ... + 2774048.
It is an arithmetic number, because the mean of its divisors is an integer number (16659772548).
Almost surely, 2122111102201 is an apocalyptic number.
122111102201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122111102201 is a deficient number, since it is larger than the sum of its proper divisors (11167078183).
122111102201 is a wasteful number, since it uses less digits than its factorization.
122111102201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5505751.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 122111102201 its reverse (102201111221), we get a palindrome (224312213422).
The spelling of 122111102201 in words is "one hundred twenty-two billion, one hundred eleven million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •