Base | Representation |
---|---|
bin | 110100010000000111… |
… | …1001011100101010011 |
3 | 101201122002220121201202 |
4 | 1220200033023211103 |
5 | 3314301230001321 |
6 | 123314253421415 |
7 | 11051445156521 |
oct | 1504017134523 |
9 | 351562817652 |
10 | 112210000211 |
11 | 4365168aa71 |
12 | 198b6a9a86b |
13 | a77332023a |
14 | 5606905311 |
15 | 2dbb13c70b |
hex | 1a203cb953 |
112210000211 has 8 divisors (see below), whose sum is σ = 114617697600. Its totient is φ = 109803146688.
The previous prime is 112210000183. The next prime is 112210000213. The reversal of 112210000211 is 112000012211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112210000211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112210000192 and 112210000201.
It is not an unprimeable number, because it can be changed into a prime (112210000213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61565 + ... + 477713.
It is an arithmetic number, because the mean of its divisors is an integer number (14327212200).
Almost surely, 2112210000211 is an apocalyptic number.
112210000211 is a deficient number, since it is larger than the sum of its proper divisors (2407697389).
112210000211 is an equidigital number, since it uses as much as digits as its factorization.
112210000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421933.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112210000211 its reverse (112000012211), we get a palindrome (224210012422).
The spelling of 112210000211 in words is "one hundred twelve billion, two hundred ten million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •