Base | Representation |
---|---|
bin | 10100101100110010… |
… | …100110101000000000 |
3 | 2010100222200222212210 |
4 | 110230302212220000 |
5 | 331004413040032 |
6 | 14113254422120 |
7 | 1414534266453 |
oct | 245462465000 |
9 | 63328628783 |
10 | 22226299392 |
11 | 9476191780 |
12 | 4383661940 |
13 | 21329b6a5b |
14 | 110bc4b49a |
15 | 8a14302cc |
hex | 52cca6a00 |
22226299392 has 320 divisors, whose sum is σ = 68899590144. Its totient is φ = 6292439040.
The previous prime is 22226299373. The next prime is 22226299397. The reversal of 22226299392 is 29399262222.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (22226299397) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64052563 + ... + 64052909.
Almost surely, 222226299392 is an apocalyptic number.
22226299392 is a gapful number since it is divisible by the number (22) 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 22226299392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34449795072).
22226299392 is an abundant number, since it is smaller than the sum of its proper divisors (46673290752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22226299392 is a wasteful number, since it uses less digits than its factorization.
22226299392 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619 (or 603 counting only the distinct ones).
The product of its digits is 839808, while the sum is 48.
The spelling of 22226299392 in words is "twenty-two billion, two hundred twenty-six million, two hundred ninety-nine thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •