Base | Representation |
---|---|
bin | 10100011111010100… |
… | …00011100011110110 |
3 | 1001101121122000221020 |
4 | 22033222003203312 |
5 | 140012011213420 |
6 | 5015310202010 |
7 | 536410213425 |
oct | 121752034366 |
9 | 31347560836 |
10 | 11000101110 |
11 | 47352a7859 |
12 | 216bab3306 |
13 | 1063c6168b |
14 | 764cd92bc |
15 | 445aae340 |
hex | 28fa838f6 |
11000101110 has 128 divisors (see below), whose sum is σ = 28695168000. Its totient is φ = 2689251840.
The previous prime is 11000101087. The next prime is 11000101117. The reversal of 11000101110 is 1110100011.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000101117) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4195600 + ... + 4198220.
It is an arithmetic number, because the mean of its divisors is an integer number (224181000).
Almost surely, 211000101110 is an apocalyptic number.
11000101110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 11000101110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14347584000).
11000101110 is an abundant number, since it is smaller than the sum of its proper divisors (17695066890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000101110 is a wasteful number, since it uses less digits than its factorization.
11000101110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2886.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11000101110 its reverse (1110100011), we get a palindrome (12110201121).
The spelling of 11000101110 in words is "eleven billion, one hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •