Base | Representation |
---|---|
bin | 10100101000100111… |
… | …101000110110001000 |
3 | 2010012010000110202210 |
4 | 110220213220312020 |
5 | 330334004103130 |
6 | 14102314425120 |
7 | 1413024402405 |
oct | 245047506610 |
9 | 63163013683 |
10 | 22156316040 |
11 | 943a7321a1 |
12 | 43641321a0 |
13 | 21213529a1 |
14 | 11028312ac |
15 | 89a2095b0 |
hex | 5289e8d88 |
22156316040 has 32 divisors (see below), whose sum is σ = 66468948480. Its totient is φ = 5908350912.
The previous prime is 22156316033. The next prime is 22156316041. The reversal of 22156316040 is 4061365122.
It is a super-2 number, since 2×221563160402 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 22156315989 and 22156316007.
It is not an unprimeable number, because it can be changed into a prime (22156316041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92317864 + ... + 92318103.
It is an arithmetic number, because the mean of its divisors is an integer number (2077154640).
Almost surely, 222156316040 is an apocalyptic number.
22156316040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22156316040 is an abundant number, since it is smaller than the sum of its proper divisors (44312632440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22156316040 is a wasteful number, since it uses less digits than its factorization.
22156316040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184635981 (or 184635977 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The spelling of 22156316040 in words is "twenty-two billion, one hundred fifty-six million, three hundred sixteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •