Base | Representation |
---|---|
bin | 10100011111010011… |
… | …110110110010110000 |
3 | 2002210020010200010120 |
4 | 110133103312302300 |
5 | 330024013312334 |
6 | 14035015130240 |
7 | 1406120031165 |
oct | 243723666260 |
9 | 62706120116 |
10 | 22000135344 |
11 | 936a559340 |
12 | 431b973980 |
13 | 20c7b9b785 |
14 | 10c9bb806c |
15 | 88b658949 |
hex | 51f4f6cb0 |
22000135344 has 80 divisors (see below), whose sum is σ = 62098061184. Its totient is φ = 6656204800.
The previous prime is 22000135337. The next prime is 22000135369. The reversal of 22000135344 is 44353100022.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 305947 + ... + 370949.
Almost surely, 222000135344 is an apocalyptic number.
22000135344 is a gapful number since it is divisible by the number (24) 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 22000135344, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31049030592).
22000135344 is an abundant number, since it is smaller than the sum of its proper divisors (40097925840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22000135344 is a wasteful number, since it uses less digits than its factorization.
22000135344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65666 (or 65660 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 24.
Adding to 22000135344 its reverse (44353100022), we get a palindrome (66353235366).
The spelling of 22000135344 in words is "twenty-two billion, one hundred thirty-five thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •