Base | Representation |
---|---|
bin | 10100101100011010… |
… | …10010100111011000 |
3 | 1001200021102112101200 |
4 | 22112031102213120 |
5 | 140223130013422 |
6 | 5034233514200 |
7 | 542213310540 |
oct | 122615224730 |
9 | 31607375350 |
10 | 11110001112 |
11 | 4791340301 |
12 | 21a0872960 |
13 | 1080960372 |
14 | 775746320 |
15 | 45056c2ac |
hex | 2963529d8 |
11110001112 has 48 divisors (see below), whose sum is σ = 34388100240. Its totient is φ = 3174285888.
The previous prime is 11110001069. The next prime is 11110001129. The reversal of 11110001112 is 21110001111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11110001094 and 11110001103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11021323 + ... + 11022330.
It is an arithmetic number, because the mean of its divisors is an integer number (716418755).
Almost surely, 211110001112 is an apocalyptic number.
11110001112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
11110001112 is an abundant number, since it is smaller than the sum of its proper divisors (23278099128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110001112 is a wasteful number, since it uses less digits than its factorization.
11110001112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22043672 (or 22043665 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11110001112 its reverse (21110001111), we get a palindrome (32220002223).
Subtracting 11110001112 from its reverse (21110001111), we obtain a palindrome (9999999999).
The spelling of 11110001112 in words is "eleven billion, one hundred ten million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •