Base | Representation |
---|---|
bin | 1010000000110000011101… |
… | …10101011010011100011000 |
3 | 2212221201210101220000000110 |
4 | 11000120032311122130120 |
5 | 10341203240304223024 |
6 | 114454043131404320 |
7 | 4431423141555006 |
oct | 500301665323430 |
9 | 85851711800013 |
10 | 22016251242264 |
11 | 7019048955754 |
12 | 2576a91bb36a0 |
13 | c3917b68a296 |
14 | 56184119da76 |
15 | 282a5e936629 |
hex | 14060ed5a718 |
22016251242264 has 64 divisors (see below), whose sum is σ = 55186806240000. Its totient is φ = 7319285642880.
The previous prime is 22016251242257. The next prime is 22016251242281. The reversal of 22016251242264 is 46224215261022.
It is a super-2 number, since 2×220162512422642 (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 15 ways as a sum of consecutive naturals, for example, 12947437 + ... + 14548835.
It is an arithmetic number, because the mean of its divisors is an integer number (862293847500).
Almost surely, 222016251242264 is an apocalyptic number.
22016251242264 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
22016251242264 is an abundant number, since it is smaller than the sum of its proper divisors (33170554997736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22016251242264 is a wasteful number, since it uses less digits than its factorization.
22016251242264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1602928 (or 1602924 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 39.
The spelling of 22016251242264 in words is "twenty-two trillion, sixteen billion, two hundred fifty-one million, two hundred forty-two thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.508 sec. • engine limits •