Base | Representation |
---|---|
bin | 1001001100011111000011… |
… | …1011001111101100010110 |
3 | 1022210111221021000100110000 |
4 | 2103013300323033230112 |
5 | 2311120441112010402 |
6 | 33300303232312130 |
7 | 2062300464006036 |
oct | 223076073175426 |
9 | 38714837010400 |
10 | 10110100110102 |
11 | 324873aa40353 |
12 | 11734a40a2646 |
13 | 5844bc307075 |
14 | 26d48d7318c6 |
15 | 127ec0c12c1c |
hex | 931f0ecfb16 |
10110100110102 has 20 divisors (see below), whose sum is σ = 22654113210036. Its totient is φ = 3370033369980.
The previous prime is 10110100110059. The next prime is 10110100110133. The reversal of 10110100110102 is 20101100101101.
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 9 ways as a sum of consecutive naturals, for example, 31204012524 + ... + 31204012847.
Almost surely, 210110100110102 is an apocalyptic number.
10110100110102 is an abundant number, since it is smaller than the sum of its proper divisors (12544013099934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10110100110102 is an equidigital number, since it uses as much as digits as its factorization.
10110100110102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62408025385 (or 62408025376 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10110100110102 its reverse (20101100101101), we get a palindrome (30211200211203).
Subtracting 10110100110102 from its reverse (20101100101101), we obtain a palindrome (9990999990999).
The spelling of 10110100110102 in words is "ten trillion, one hundred ten billion, one hundred million, one hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •