Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …010110101000011001110011 |
3 | 112200121001122121111011222222 |
4 | 121131331202112220121303 |
5 | 104140133142131242321 |
6 | 1034120421450151255 |
7 | 32410314515434430 |
oct | 3135754226503163 |
9 | 480531577434888 |
10 | 112010102212211 |
11 | 32765243668595 |
12 | 1069038472252b |
13 | 4a6667975c698 |
14 | 1d9346435cb87 |
15 | ce398e53d3ab |
hex | 65df625a8673 |
112010102212211 has 8 divisors (see below), whose sum is σ = 128011609396224. Its totient is φ = 96008611030920.
The previous prime is 112010102212199. The next prime is 112010102212247. The reversal of 112010102212211 is 112212201010211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-112010102212211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112010102212211.
It is not an unprimeable number, because it can be changed into a prime (112010102211211) 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, 25531646 + ... + 29595356.
It is an arithmetic number, because the mean of its divisors is an integer number (16001451174528).
Almost surely, 2112010102212211 is an apocalyptic number.
112010102212211 is a deficient number, since it is larger than the sum of its proper divisors (16001507184013).
112010102212211 is an equidigital number, since it uses as much as digits as its factorization.
112010102212211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8001361.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112010102212211 its reverse (112212201010211), we get a palindrome (224222303222422).
The spelling of 112010102212211 in words is "one hundred twelve trillion, ten billion, one hundred two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •