Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …0011010010011011011110 |
3 | 1022102221211210000000211000 |
4 | 2101222221003102123132 |
5 | 2303001201130323402 |
6 | 33142325301411130 |
7 | 2052130600125315 |
oct | 221525103223336 |
9 | 38387753000730 |
10 | 10010110011102 |
11 | 320a29a157aa3 |
12 | 1158039709aa6 |
13 | 577c45883106 |
14 | 2686c5b2b27c |
15 | 1255bc7d1c1c |
hex | 91aa90d26de |
10010110011102 has 64 divisors (see below), whose sum is σ = 22738771445760. Its totient is φ = 3262720904352.
The previous prime is 10010110011089. The next prime is 10010110011113. The reversal of 10010110011102 is 20111001101001.
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, 969783 + ... + 4578285.
It is an arithmetic number, because the mean of its divisors is an integer number (355293303840).
Almost surely, 210010110011102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10010110011102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11369385722880).
10010110011102 is an abundant number, since it is smaller than the sum of its proper divisors (12728661434658).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010110011102 is a wasteful number, since it uses less digits than its factorization.
10010110011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3609654 (or 3609648 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10010110011102 its reverse (20111001101001), we get a palindrome (30121111112103).
The spelling of 10010110011102 in words is "ten trillion, ten billion, one hundred ten million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •