Base | Representation |
---|---|
bin | 1010000010001011100100… |
… | …11000101011000111001100 |
3 | 2220010102001100202201110010 |
4 | 11001011302120223013030 |
5 | 10343003430003221340 |
6 | 114532333010113220 |
7 | 4435104246002610 |
oct | 501056230530714 |
9 | 86112040681403 |
10 | 22065166070220 |
11 | 703786a0109a9 |
12 | 258446357b810 |
13 | c4097566b570 |
14 | 563d61731340 |
15 | 283e73dc3b80 |
hex | 14117262b1cc |
22065166070220 has 192 divisors, whose sum is σ = 76956102558720. Its totient is φ = 4599417019392.
The previous prime is 22065166070177. The next prime is 22065166070221. The reversal of 22065166070220 is 2207066156022.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (22065166070221) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 23891635 + ... + 24797994.
It is an arithmetic number, because the mean of its divisors is an integer number (400813034160).
Almost surely, 222065166070220 is an apocalyptic number.
22065166070220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22065166070220 is an abundant number, since it is smaller than the sum of its proper divisors (54890936488500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22065166070220 is a wasteful number, since it uses less digits than its factorization.
22065166070220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48689744 (or 48689742 counting only the distinct ones).
The product of its (nonzero) digits is 120960, while the sum is 39.
The spelling of 22065166070220 in words is "twenty-two trillion, sixty-five billion, one hundred sixty-six million, seventy thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •