Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100010000011010010110 |
3 | 10220020220021202200022000 |
4 | 100001121110100122112 |
5 | 121014332042010402 |
6 | 2201444055420130 |
7 | 142355025343650 |
oct | 20013124203226 |
9 | 3806807680260 |
10 | 1101010110102 |
11 | 394a3255a731 |
12 | 159472084646 |
13 | 7ca95145166 |
14 | 3b4096c76d0 |
15 | 1d98e4ccc1c |
hex | 10059510696 |
1101010110102 has 64 divisors (see below), whose sum is σ = 2814982848000. Its totient is φ = 312463064160.
The previous prime is 1101010110073. The next prime is 1101010110131. The reversal of 1101010110102 is 2010110101011.
It is an interprime number because it is at equal distance from previous prime (1101010110073) and next prime (1101010110131).
It is a Harshad number since it is a multiple of its sum of digits (9).
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, 9717924 + ... + 9830567.
It is an arithmetic number, because the mean of its divisors is an integer number (43984107000).
Almost surely, 21101010110102 is an apocalyptic number.
1101010110102 is an abundant number, since it is smaller than the sum of its proper divisors (1713972737898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101010110102 is a wasteful number, since it uses less digits than its factorization.
1101010110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19548658 (or 19548652 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1101010110102 its reverse (2010110101011), we get a palindrome (3111120211113).
Subtracting 1101010110102 from its reverse (2010110101011), we obtain a palindrome (909099990909).
The spelling of 1101010110102 in words is "one trillion, one hundred one billion, ten million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •