Base | Representation |
---|---|
bin | 11101011001011101010… |
… | …01101111110001111110 |
3 | 10120120020121101002200120 |
4 | 32230232221233301332 |
5 | 113022141100310420 |
6 | 2052011124435410 |
7 | 132656135264442 |
oct | 16545651576176 |
9 | 3516217332616 |
10 | 1010100010110 |
11 | 35a421138a94 |
12 | 143920548b66 |
13 | 74337901299 |
14 | 36c639a0822 |
15 | 1b41d2cbd40 |
hex | eb2ea6fc7e |
1010100010110 has 16 divisors (see below), whose sum is σ = 2424240024336. Its totient is φ = 269360002688.
The previous prime is 1010100010097. The next prime is 1010100010111. The reversal of 1010100010110 is 110100010101.
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 (1010100010111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16835000139 + ... + 16835000198.
It is an arithmetic number, because the mean of its divisors is an integer number (151515001521).
Almost surely, 21010100010110 is an apocalyptic number.
1010100010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010100010110 is an abundant number, since it is smaller than the sum of its proper divisors (1414140014226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010100010110 is a wasteful number, since it uses less digits than its factorization.
1010100010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33670000347.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1010100010110 its reverse (110100010101), we get a palindrome (1120200020211).
Subtracting from 1010100010110 its reverse (110100010101), we obtain a palindrome (900000000009).
The spelling of 1010100010110 in words is "one trillion, ten billion, one hundred million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •