Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …0010000001000111011111 |
3 | 1022210111200100221022121211 |
4 | 2103013223002001013133 |
5 | 2311120240303101421 |
6 | 33300245341005251 |
7 | 2062265153324620 |
oct | 223075302010737 |
9 | 38714610838554 |
10 | 10110001222111 |
11 | 324869a13933a |
12 | 1173476b53827 |
13 | 5844a499276b |
14 | 26d48054da47 |
15 | 127eb71cc9e1 |
hex | 931eb0811df |
10110001222111 has 16 divisors (see below), whose sum is σ = 11928384092160. Its totient is φ = 8385207193440.
The previous prime is 10110001222093. The next prime is 10110001222117. The reversal of 10110001222111 is 11122210001101.
It is a happy number.
It is not a de Polignac number, because 10110001222111 - 29 = 10110001221599 is a prime.
It is a super-2 number, since 2×101100012221112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10110001222091 and 10110001222100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110001222117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 805981 + ... + 4568326.
It is an arithmetic number, because the mean of its divisors is an integer number (745524005760).
Almost surely, 210110001222111 is an apocalyptic number.
10110001222111 is a deficient number, since it is larger than the sum of its proper divisors (1818382870049).
10110001222111 is an equidigital number, since it uses as much as digits as its factorization.
10110001222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383014.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10110001222111 its reverse (11122210001101), we get a palindrome (21232211223212).
The spelling of 10110001222111 in words is "ten trillion, one hundred ten billion, one million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •