Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …11110100001110111110 |
3 | 10112200202111000000012120 |
4 | 32210100103310032332 |
5 | 112400022224310420 |
6 | 2043504205343410 |
7 | 132214511124603 |
oct | 16442023641676 |
9 | 3480674000176 |
10 | 1001001010110 |
11 | 356581a79682 |
12 | 142001267b66 |
13 | 7351779a70a |
14 | 3663d3786aa |
15 | 1b089596d40 |
hex | e9104f43be |
1001001010110 has 32 divisors (see below), whose sum is σ = 2528844658560. Its totient is φ = 252884465568.
The previous prime is 1001001010027. The next prime is 1001001010111. The reversal of 1001001010110 is 110101001001.
1001001010110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (1001001010111) 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, 878070492 + ... + 878071631.
It is an arithmetic number, because the mean of its divisors is an integer number (79026395580).
Almost surely, 21001001010110 is an apocalyptic number.
1001001010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1001001010110 is an abundant number, since it is smaller than the sum of its proper divisors (1527843648450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001001010110 is a wasteful number, since it uses less digits than its factorization.
1001001010110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1756142152.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 1001001010110 its reverse (110101001001), we get a palindrome (1111102011111).
The spelling of 1001001010110 in words is "one trillion, one billion, one million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •