Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00011010010100000 |
3 | 1001101121121222102010 |
4 | 22033222003102200 |
5 | 140012011200000 |
6 | 5015310152520 |
7 | 536410210251 |
oct | 121752032240 |
9 | 31347558363 |
10 | 11000100000 |
11 | 47352a6a3a |
12 | 216bab2740 |
13 | 1063c61016 |
14 | 764cd8b28 |
15 | 445aadd50 |
hex | 28fa834a0 |
11000100000 has 288 divisors, whose sum is σ = 37104625152. Its totient is φ = 2851200000.
The previous prime is 11000099993. The next prime is 11000100017. The reversal of 11000100000 is 100011.
It is a Harshad number since it is a multiple of its sum of digits (3).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11099505 + ... + 11100495.
It is an arithmetic number, because the mean of its divisors is an integer number (128835504).
Almost surely, 211000100000 is an apocalyptic number.
11000100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11000100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18552312576).
11000100000 is an abundant number, since it is smaller than the sum of its proper divisors (26104525152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000100000 is an frugal number, since it uses more digits than its factorization.
11000100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1066 (or 1038 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 3.
Adding to 11000100000 its reverse (100011), we get a palindrome (11000200011).
The spelling of 11000100000 in words is "eleven billion, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •