Base | Representation |
---|---|
bin | 11001000000101111011100… |
… | …110000110011101100010110 |
3 | 112102111002200021010212002111 |
4 | 121000233130300303230112 |
5 | 103404233310431400042 |
6 | 1025542134450101234 |
7 | 32112250601441626 |
oct | 3100573460635426 |
9 | 472432607125074 |
10 | 110002111200022 |
11 | 320606a7028aa8 |
12 | 1040719057a81a |
13 | 494c2017b1142 |
14 | 1d241b84a4886 |
15 | cab619c3d517 |
hex | 640bdcc33b16 |
110002111200022 has 8 divisors (see below), whose sum is σ = 165693556620000. Its totient is φ = 54770925660024.
The previous prime is 110002111200017. The next prime is 110002111200053. The reversal of 110002111200022 is 220002111200011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 110002111199975 and 110002111200011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 115064969397 + ... + 115064970352.
It is an arithmetic number, because the mean of its divisors is an integer number (20711694577500).
Almost surely, 2110002111200022 is an apocalyptic number.
110002111200022 is a deficient number, since it is larger than the sum of its proper divisors (55691445419978).
110002111200022 is a wasteful number, since it uses less digits than its factorization.
110002111200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230129939990.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110002111200022 its reverse (220002111200011), we get a palindrome (330004222400033).
The spelling of 110002111200022 in words is "one hundred ten trillion, two billion, one hundred eleven million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •