Base | Representation |
---|---|
bin | 11001100000110111110100… |
… | …010101111110100111100011 |
3 | 112201022011221012021002202120 |
4 | 121200313310111332213203 |
5 | 104201422311210311321 |
6 | 1034352341213515323 |
7 | 32430625243606566 |
oct | 3140676425764743 |
9 | 481264835232676 |
10 | 112210120010211 |
11 | 32832054485683 |
12 | 107030a61a2b43 |
13 | 4a7c4a4670902 |
14 | 1d9cdda9544dd |
15 | ce8c9932aec6 |
hex | 660df457e9e3 |
112210120010211 has 8 divisors (see below), whose sum is σ = 153262602940944. Its totient is φ = 72982191876480.
The previous prime is 112210120010159. The next prime is 112210120010269. The reversal of 112210120010211 is 112010021012211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112210120010211 - 215 = 112210119977443 is a prime.
It is a super-2 number, since 2×1122101200102112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112210120000211) 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, 456138699106 + ... + 456138699351.
It is an arithmetic number, because the mean of its divisors is an integer number (19157825367618).
Almost surely, 2112210120010211 is an apocalyptic number.
112210120010211 is a deficient number, since it is larger than the sum of its proper divisors (41052482930733).
112210120010211 is an equidigital number, since it uses as much as digits as its factorization.
112210120010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912277398501.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112210120010211 its reverse (112010021012211), we get a palindrome (224220141022422).
The spelling of 112210120010211 in words is "one hundred twelve trillion, two hundred ten billion, one hundred twenty million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •