Base | Representation |
---|---|
bin | 10010110101001101… |
… | …00101111111010110 |
3 | 222002120202021021120 |
4 | 21122212211333112 |
5 | 131201130013420 |
6 | 4351112224410 |
7 | 505351406616 |
oct | 113246457726 |
9 | 28076667246 |
10 | 10110001110 |
11 | 4318917520 |
12 | 1b6199b106 |
13 | c517231a1 |
14 | 6bc9d8a46 |
15 | 3e288ad40 |
hex | 25a9a5fd6 |
10110001110 has 64 divisors (see below), whose sum is σ = 26550077184. Its totient is φ = 2443478400.
The previous prime is 10110001093. The next prime is 10110001157. The reversal of 10110001110 is 1110001101.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 62952 + ... + 155508.
It is an arithmetic number, because the mean of its divisors is an integer number (414844956).
Almost surely, 210110001110 is an apocalyptic number.
10110001110 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 10110001110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13275038592).
10110001110 is an abundant number, since it is smaller than the sum of its proper divisors (16440076074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110001110 is a wasteful number, since it uses less digits than its factorization.
10110001110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92909.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10110001110 its reverse (1110001101), we get a palindrome (11220002211).
Subtracting from 10110001110 its reverse (1110001101), we obtain a palindrome (9000000009).
The spelling of 10110001110 in words is "ten billion, one hundred ten million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •