Base | Representation |
---|---|
bin | 11011101111010111011010… |
… | …011000111101111011110111 |
3 | 120222222022000210011120221021 |
4 | 123233113122120331323313 |
5 | 111442341011231133421 |
6 | 1111251012550202011 |
7 | 34461240332436400 |
oct | 3357273230757367 |
9 | 528868023146837 |
10 | 122002210021111 |
11 | 35967934a69622 |
12 | 11824a19353307 |
13 | 530c9b37c0a34 |
14 | 221ad1d2489a7 |
15 | e1885667e341 |
hex | 6ef5da63def7 |
122002210021111 has 6 divisors (see below), whose sum is σ = 141920938187880. Its totient is φ = 104573322875196.
The previous prime is 122002210021067. The next prime is 122002210021141. The reversal of 122002210021111 is 111120012200221.
It is not a de Polignac number, because 122002210021111 - 27 = 122002210020983 is a prime.
It is a super-2 number, since 2×1220022100211112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122002210021141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1244920510371 + ... + 1244920510468.
It is an arithmetic number, because the mean of its divisors is an integer number (23653489697980).
Almost surely, 2122002210021111 is an apocalyptic number.
122002210021111 is a deficient number, since it is larger than the sum of its proper divisors (19918728166769).
122002210021111 is an equidigital number, since it uses as much as digits as its factorization.
122002210021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2489841020853 (or 2489841020846 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122002210021111 its reverse (111120012200221), we get a palindrome (233122222221332).
The spelling of 122002210021111 in words is "one hundred twenty-two trillion, two billion, two hundred ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •