Base | Representation |
---|---|
bin | 10010110101010101… |
… | …10101001110110000 |
3 | 222002122211201021210 |
4 | 21122222311032300 |
5 | 131201421041422 |
6 | 4351152120120 |
7 | 505364014653 |
oct | 113252651660 |
9 | 28078751253 |
10 | 10111112112 |
11 | 4319506202 |
12 | 1b62236040 |
13 | c51a21a9a |
14 | 6bcc0789a |
15 | 3e2a0a10c |
hex | 25aab53b0 |
10111112112 has 80 divisors (see below), whose sum is σ = 26444656640. Its totient is φ = 3328770816.
The previous prime is 10111112071. The next prime is 10111112129. The reversal of 10111112112 is 21121111101.
10111112112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1392363 + ... + 1399605.
It is an arithmetic number, because the mean of its divisors is an integer number (330558208).
Almost surely, 210111112112 is an apocalyptic number.
10111112112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10111112112 is an abundant number, since it is smaller than the sum of its proper divisors (16333544528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111112112 is a wasteful number, since it uses less digits than its factorization.
10111112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7610 (or 7604 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10111112112 its reverse (21121111101), we get a palindrome (31232223213).
The spelling of 10111112112 in words is "ten billion, one hundred eleven million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •