Base | Representation |
---|---|
bin | 10010110100000001… |
… | …10100110000001110 |
3 | 222001220010020122212 |
4 | 21122000310300032 |
5 | 131141111200420 |
6 | 4350120110422 |
7 | 505201302002 |
oct | 113200646016 |
9 | 28056106585 |
10 | 10100100110 |
11 | 4313274781 |
12 | 1b5a605412 |
13 | c4c6676c9 |
14 | 6bb57c702 |
15 | 3e1a823c5 |
hex | 25a034c0e |
10100100110 has 8 divisors (see below), whose sum is σ = 18180180216. Its totient is φ = 4040040040.
The previous prime is 10100100079. The next prime is 10100100133. The reversal of 10100100110 is 1100100101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 10100100094 and 10100100103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505004996 + ... + 505005015.
It is an arithmetic number, because the mean of its divisors is an integer number (2272522527).
Almost surely, 210100100110 is an apocalyptic number.
10100100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100100110 is a deficient number, since it is larger than the sum of its proper divisors (8080080106).
10100100110 is a wasteful number, since it uses less digits than its factorization.
10100100110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010010018.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10100100110 its reverse (1100100101), we get a palindrome (11200200211).
Subtracting from 10100100110 its reverse (1100100101), we obtain a palindrome (9000000009).
The spelling of 10100100110 in words is "ten billion, one hundred million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •