Base | Representation |
---|---|
bin | 10100101100001011… |
… | …010111111010110000 |
3 | 2010100021100112002020 |
4 | 110230023113322300 |
5 | 330444244444121 |
6 | 14112250151440 |
7 | 1414351005411 |
oct | 245413277260 |
9 | 63307315066 |
10 | 22216015536 |
11 | 94703a8320 |
12 | 4380122580 |
13 | 2130825c30 |
14 | 110a731808 |
15 | 8a059d1c6 |
hex | 52c2d7eb0 |
22216015536 has 320 divisors, whose sum is σ = 69363227136. Its totient is φ = 6038323200.
The previous prime is 22216015519. The next prime is 22216015567. The reversal of 22216015536 is 63551061222.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 22216015497 and 22216015506.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 40614015 + ... + 40614561.
Almost surely, 222216015536 is an apocalyptic number.
22216015536 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22216015536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34681613568).
22216015536 is an abundant number, since it is smaller than the sum of its proper divisors (47147211600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22216015536 is a wasteful number, since it uses less digits than its factorization.
22216015536 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 740 (or 734 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 22216015536 its reverse (63551061222), we get a palindrome (85767076758).
The spelling of 22216015536 in words is "twenty-two billion, two hundred sixteen million, fifteen thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •