Base | Representation |
---|---|
bin | 1010000011100111000111… |
… | …01001101111011011010000 |
3 | 2220022002220100122022221221 |
4 | 11001303203221233123100 |
5 | 10344310102104310000 |
6 | 115011101344454424 |
7 | 4441464146050456 |
oct | 501634351573320 |
9 | 86262810568857 |
10 | 22114311010000 |
11 | 7056699056610 |
12 | 2591a9a01a414 |
13 | c454a821a9a1 |
14 | 5664a46829d6 |
15 | 28539d66761a |
hex | 141ce3a6f6d0 |
22114311010000 has 100 divisors (see below), whose sum is σ = 58408318530144. Its totient is φ = 8041567600000.
The previous prime is 22114311009979. The next prime is 22114311010039. The reversal of 22114311010000 is 1011341122.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (16).
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 19 ways as a sum of consecutive naturals, for example, 100409596 + ... + 100629595.
Almost surely, 222114311010000 is an apocalyptic number.
22114311010000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22114311010000 is an abundant number, since it is smaller than the sum of its proper divisors (36294007520144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22114311010000 is a wasteful number, since it uses less digits than its factorization.
22114311010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201039230 (or 201039209 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 22114311010000 its reverse (1011341122), we get a palindrome (22115322351122).
The spelling of 22114311010000 in words is "twenty-two trillion, one hundred fourteen billion, three hundred eleven million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •