Base | Representation |
---|---|
bin | 10100101100011010… |
… | …10010010110010100 |
3 | 1001200021102110220020 |
4 | 22112031102112110 |
5 | 140223130000040 |
6 | 5034233505140 |
7 | 542213304420 |
oct | 122615222624 |
9 | 31607373806 |
10 | 11110000020 |
11 | 479133a4a9 |
12 | 21a08721b0 |
13 | 108095ca12 |
14 | 775745b80 |
15 | 45056bcd0 |
hex | 296352594 |
11110000020 has 48 divisors (see below), whose sum is σ = 35552001408. Its totient is φ = 2539428480.
The previous prime is 11110000019. The next prime is 11110000037. The reversal of 11110000020 is 2000001111.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a junction number, because it is equal to n+sod(n) for n = 11109999963 and 11110000008.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13225771 + ... + 13226610.
It is an arithmetic number, because the mean of its divisors is an integer number (740666696).
Almost surely, 211110000020 is an apocalyptic number.
11110000020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11110000020 is an abundant number, since it is smaller than the sum of its proper divisors (24442001388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110000020 is a wasteful number, since it uses less digits than its factorization.
11110000020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26452400 (or 26452398 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 11110000020 its reverse (2000001111), we get a palindrome (13110001131).
The spelling of 11110000020 in words is "eleven billion, one hundred ten million, twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •