Base | Representation |
---|---|
bin | 1001001100100110111101… |
… | …0010110100101011001111 |
3 | 1022210201102000101002121221 |
4 | 2103021233102310223033 |
5 | 2311134311334020421 |
6 | 33301253445504211 |
7 | 2062404146440552 |
oct | 223115722645317 |
9 | 38721360332557 |
10 | 10112220220111 |
11 | 3249628764389 |
12 | 1173996112067 |
13 | 584769616429 |
14 | 26d611134699 |
15 | 128096ded841 |
hex | 9326f4b4acf |
10112220220111 has 8 divisors (see below), whose sum is σ = 10125026271360. Its totient is φ = 10099420006272.
The previous prime is 10112220220057. The next prime is 10112220220117. The reversal of 10112220220111 is 11102202221101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10112220220111 - 215 = 10112220187343 is a prime.
It is a super-2 number, since 2×101122202201112 (a number of 27 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 (10112220220117) 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, 2012691 + ... + 4927003.
It is an arithmetic number, because the mean of its divisors is an integer number (1265628283920).
Almost surely, 210112220220111 is an apocalyptic number.
10112220220111 is a deficient number, since it is larger than the sum of its proper divisors (12806051249).
10112220220111 is a wasteful number, since it uses less digits than its factorization.
10112220220111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2918705.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10112220220111 its reverse (11102202221101), we get a palindrome (21214422441212).
The spelling of 10112220220111 in words is "ten trillion, one hundred twelve billion, two hundred twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •