Base | Representation |
---|---|
bin | 10100100000100101… |
… | …001010011000100000 |
3 | 2002211201020112022102 |
4 | 110200211022120200 |
5 | 330044442333443 |
6 | 14041100025532 |
7 | 1406466141641 |
oct | 244045123040 |
9 | 62751215272 |
10 | 22021449248 |
11 | 9380596837 |
12 | 4326b322a8 |
13 | 20cc421c56 |
14 | 10cc9656c8 |
15 | 88d468cb8 |
hex | 52094a620 |
22021449248 has 54 divisors (see below), whose sum is σ = 44621081631. Its totient is φ = 10698027264.
The previous prime is 22021449227. The next prime is 22021449253. The reversal of 22021449248 is 84294412022.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 11970985744 + 10050463504 = 109412^2 + 100252^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=104932.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 31059518 + ... + 31060226.
Almost surely, 222021449248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22021449248
22021449248 is an abundant number, since it is smaller than the sum of its proper divisors (22599632383).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22021449248 is an frugal number, since it uses more digits than its factorization.
22021449248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1502 (or 748 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 38.
The spelling of 22021449248 in words is "twenty-two billion, twenty-one million, four hundred forty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •