Base | Representation |
---|---|
bin | 1010000010001010100001… |
… | …10001011110000011111100 |
3 | 2220010100121001122100111121 |
4 | 11001011100301132003330 |
5 | 10343001301122120040 |
6 | 114532201023200324 |
7 | 4435054260503041 |
oct | 501052061360374 |
9 | 86110531570447 |
10 | 22064602145020 |
11 | 70375aa762616 |
12 | 25843267460a4 |
13 | c408b5893a06 |
14 | 563d0a8991c8 |
15 | 283e3e62ec4a |
hex | 141150c5e0fc |
22064602145020 has 12 divisors (see below), whose sum is σ = 46335664504584. Its totient is φ = 8825840858000.
The previous prime is 22064602145011. The next prime is 22064602145057. The reversal of 22064602145020 is 2054120646022.
It is a super-2 number, since 2×220646021450202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551615053606 + ... + 551615053645.
It is an arithmetic number, because the mean of its divisors is an integer number (3861305375382).
Almost surely, 222064602145020 is an apocalyptic number.
22064602145020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22064602145020 is an abundant number, since it is smaller than the sum of its proper divisors (24271062359564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22064602145020 is a wasteful number, since it uses less digits than its factorization.
22064602145020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103230107260 (or 1103230107258 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 34.
The spelling of 22064602145020 in words is "twenty-two trillion, sixty-four billion, six hundred two million, one hundred forty-five thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •