Base | Representation |
---|---|
bin | 10100101100101001… |
… | …11010101011011110 |
3 | 1001200102012002122210 |
4 | 22112110322223132 |
5 | 140224133001342 |
6 | 5034344421250 |
7 | 542236305051 |
oct | 122624725336 |
9 | 31612162583 |
10 | 11112000222 |
11 | 4792486264 |
12 | 21a1477826 |
13 | 10811b027b |
14 | 775b06a98 |
15 | 45081479c |
hex | 29653aade |
11112000222 has 8 divisors (see below), whose sum is σ = 22224000456. Its totient is φ = 3704000072.
The previous prime is 11112000181. The next prime is 11112000259. The reversal of 11112000222 is 22200021111.
11112000222 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
11112000222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11112000198 and 11112000207.
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, 926000013 + ... + 926000024.
It is an arithmetic number, because the mean of its divisors is an integer number (2778000057).
Almost surely, 211112000222 is an apocalyptic number.
11112000222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11112000222 is a wasteful number, since it uses less digits than its factorization.
11112000222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1852000042.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11112000222 its reverse (22200021111), we get a palindrome (33312021333).
The spelling of 11112000222 in words is "eleven billion, one hundred twelve million, two hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •