Base | Representation |
---|---|
bin | 1001001100100110111101… |
… | …0010011001110110000011 |
3 | 1022210201102000011111212120 |
4 | 2103021233102121312003 |
5 | 2311134311322011321 |
6 | 33301253443255323 |
7 | 2062404145502262 |
oct | 223115722316603 |
9 | 38721360144776 |
10 | 10112220110211 |
11 | 324962869985a |
12 | 117399607a543 |
13 | 5847695a83bb |
14 | 26d6111065d9 |
15 | 128096dcaec6 |
hex | 9326f499d83 |
10112220110211 has 4 divisors (see below), whose sum is σ = 13482960146952. Its totient is φ = 6741480073472.
The previous prime is 10112220110189. The next prime is 10112220110297. The reversal of 10112220110211 is 11201102221101.
It is a happy number.
10112220110211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10112220110211 - 214 = 10112220093827 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10112220111211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1685370018366 + ... + 1685370018371.
It is an arithmetic number, because the mean of its divisors is an integer number (3370740036738).
Almost surely, 210112220110211 is an apocalyptic number.
10112220110211 is a deficient number, since it is larger than the sum of its proper divisors (3370740036741).
10112220110211 is an equidigital number, since it uses as much as digits as its factorization.
10112220110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370740036740.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 10112220110211 its reverse (11201102221101), we get a palindrome (21313322331312).
The spelling of 10112220110211 in words is "ten trillion, one hundred twelve billion, two hundred twenty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •