Base | Representation |
---|---|
bin | 110100001010001110… |
… | …0101101111100001110 |
3 | 101201010022202110100001 |
4 | 1220110130231330032 |
5 | 3313400112102342 |
6 | 123242510354514 |
7 | 11043524115355 |
oct | 1502434557416 |
9 | 351108673301 |
10 | 112012222222 |
11 | 4355aa8548a |
12 | 198607bba3a |
13 | a741363444 |
14 | 55c854099c |
15 | 2da8ac18b7 |
hex | 1a1472df0e |
112012222222 has 8 divisors (see below), whose sum is σ = 168039041976. Its totient is φ = 55999208232.
The previous prime is 112012222213. The next prime is 112012222277. The reversal of 112012222222 is 222222210211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120122222222 (a number of 23 digits) contains 22 as substring.
112012222222 is a modest number, since divided by 222222 gives 112012 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 112012222222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3431133 + ... + 3463624.
It is an arithmetic number, because the mean of its divisors is an integer number (21004880247).
Almost surely, 2112012222222 is an apocalyptic number.
112012222222 is a deficient number, since it is larger than the sum of its proper divisors (56026819754).
112012222222 is an equidigital number, since it uses as much as digits as its factorization.
112012222222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6902882.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 112012222222 its reverse (222222210211), we get a palindrome (334234432433).
The spelling of 112012222222 in words is "one hundred twelve billion, twelve million, two hundred twenty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •