Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …110000110100001100110101 |
3 | 112102111002200021010221221111 |
4 | 121000233130300310030311 |
5 | 103404233310431431401 |
6 | 1025542134450115021 |
7 | 32112250601450656 |
oct | 3100573460641465 |
9 | 472432607127844 |
10 | 110002111202101 |
11 | 320606a702a618 |
12 | 1040719057ba71 |
13 | 494c2017b2081 |
14 | 1d241b84a552d |
15 | cab619c3de51 |
hex | 640bdcc34335 |
110002111202101 has 16 divisors (see below), whose sum is σ = 119912668881984. Its totient is φ = 100503300973824.
The previous prime is 110002111202057. The next prime is 110002111202129. The reversal of 110002111202101 is 101202111200011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 110002111202101 - 211 = 110002111200053 is a prime.
It is a super-2 number, since 2×1100021112021012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110002111202131) 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, 461481106 + ... + 461719411.
It is an arithmetic number, because the mean of its divisors is an integer number (7494541805124).
Almost surely, 2110002111202101 is an apocalyptic number.
It is an amenable number.
110002111202101 is a deficient number, since it is larger than the sum of its proper divisors (9910557679883).
110002111202101 is a wasteful number, since it uses less digits than its factorization.
110002111202101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 923200740.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110002111202101 its reverse (101202111200011), we get a palindrome (211204222402112).
The spelling of 110002111202101 in words is "one hundred ten trillion, two billion, one hundred eleven million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •