Base | Representation |
---|---|
bin | 11101011001010010100… |
… | …10011000101011101110 |
3 | 10120120000100000010011212 |
4 | 32230221102120223232 |
5 | 113022000030000420 |
6 | 2051554151314422 |
7 | 132653663230556 |
oct | 16545122305356 |
9 | 3516010003155 |
10 | 1010010000110 |
11 | 35a385350161 |
12 | 1438b637ba12 |
13 | 74322077927 |
14 | 36c55a50166 |
15 | 1b41544c3c5 |
hex | eb29498aee |
1010010000110 has 32 divisors (see below), whose sum is σ = 1834829647200. Its totient is φ = 400268615040.
The previous prime is 1010010000061. The next prime is 1010010000119. The reversal of 1010010000110 is 110000100101.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 1010010000094 and 1010010000103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010010000119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21275981 + ... + 21323399.
It is an arithmetic number, because the mean of its divisors is an integer number (57338426475).
Almost surely, 21010010000110 is an apocalyptic number.
1010010000110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010010000110 is a deficient number, since it is larger than the sum of its proper divisors (824819647090).
1010010000110 is a wasteful number, since it uses less digits than its factorization.
1010010000110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67076.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 1010010000110 its reverse (110000100101), we get a palindrome (1120010100211).
Subtracting from 1010010000110 its reverse (110000100101), we obtain a palindrome (900009900009).
The spelling of 1010010000110 in words is "one trillion, ten billion, ten million, one hundred ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •