Base | Representation |
---|---|
bin | 10100011111100010… |
… | …10110000111010000 |
3 | 1001101202020010100002 |
4 | 22033301112013100 |
5 | 140013003341422 |
6 | 5015415145132 |
7 | 536432363030 |
oct | 121761260720 |
9 | 31352203302 |
10 | 11002012112 |
11 | 47363925a3 |
12 | 21706751a8 |
13 | 1064480450 |
14 | 7652758c0 |
15 | 445d3a692 |
hex | 28fc561d0 |
11002012112 has 160 divisors (see below), whose sum is σ = 27552403200. Its totient is φ = 4138573824.
The previous prime is 11002012097. The next prime is 11002012117. The reversal of 11002012112 is 21121020011.
It is a junction number, because it is equal to n+sod(n) for n = 11002012093 and 11002012102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002012117) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2827064 + ... + 2830952.
It is an arithmetic number, because the mean of its divisors is an integer number (172202520).
Almost surely, 211002012112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11002012112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13776201600).
11002012112 is an abundant number, since it is smaller than the sum of its proper divisors (16550391088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11002012112 is a wasteful number, since it uses less digits than its factorization.
11002012112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4013 (or 4007 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11002012112 its reverse (21121020011), we get a palindrome (32123032123).
The spelling of 11002012112 in words is "eleven billion, two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •