Base | Representation |
---|---|
bin | 1010010001001111110101… |
… | …11011110001110110000000 |
3 | 2221221220021212011002022202 |
4 | 11020213322323301312000 |
5 | 10424444140340042403 |
6 | 120010230334452332 |
7 | 4520362102505216 |
oct | 510477273616600 |
9 | 87856255132282 |
10 | 22582853049728 |
11 | 72173748a3934 |
12 | 264885b9640a8 |
13 | c7a727c1048a |
14 | 58103197ccb6 |
15 | 29267267d688 |
hex | 1489faef1d80 |
22582853049728 has 128 divisors (see below), whose sum is σ = 46034376179040. Its totient is φ = 11031010099200.
The previous prime is 22582853049683. The next prime is 22582853049767. The reversal of 22582853049728 is 82794035828522.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3330309698 + ... + 3330316478.
Almost surely, 222582853049728 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 22582853049728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23017188089520).
22582853049728 is an abundant number, since it is smaller than the sum of its proper divisors (23451523129312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22582853049728 is a wasteful number, since it uses less digits than its factorization.
22582853049728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8876 (or 8864 counting only the distinct ones).
The product of its (nonzero) digits is 154828800, while the sum is 65.
The spelling of 22582853049728 in words is "twenty-two trillion, five hundred eighty-two billion, eight hundred fifty-three million, forty-nine thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •