| Base | Representation |
|---|---|
| bin | 10010110101010101… |
| … | …10100101101110000 |
| 3 | 222002122211121101120 |
| 4 | 21122222310231300 |
| 5 | 131201421010000 |
| 6 | 4351152102240 |
| 7 | 505364005545 |
| oct | 113252645560 |
| 9 | 28078747346 |
| 10 | 10111110000 |
| 11 | 4319504662 |
| 12 | 1b62234980 |
| 13 | c51a20b34 |
| 14 | 6bcc06bcc |
| 15 | 3e2a096a0 |
| hex | 25aab4b70 |
10111110000 has 400 divisors, whose sum is σ = 34138672128. Its totient is φ = 2576000000.
The previous prime is 10111109989. The next prime is 10111110001. The reversal of 10111110000 is 1111101.
10111110000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (400).
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 congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111110001) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 100109950 + ... + 100110050.
Almost surely, 210111110000 is an apocalyptic number.
10111110000 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 10111110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17069336064).
10111110000 is an abundant number, since it is smaller than the sum of its proper divisors (24027562128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111110000 is a wasteful number, since it uses less digits than its factorization.
10111110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250 (or 229 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10111110000 its reverse (1111101), we get a palindrome (10112221101).
It can be divided in two parts, 101111 and 10000, that added together give a palindrome (111111).
The spelling of 10111110000 in words is "ten billion, one hundred eleven million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •