Base | Representation |
---|---|
bin | 1010010001011110010000… |
… | …01000010011101001100000 |
3 | 2221222122021002202220201020 |
4 | 11020233020020103221200 |
5 | 10430111012200133441 |
6 | 120013550222005440 |
7 | 4521054616036560 |
oct | 510571010235140 |
9 | 87878232686636 |
10 | 22590590630496 |
11 | 721a685525889 |
12 | 264a25b116880 |
13 | c7b38bc83135 |
14 | 581567456da0 |
15 | 292976adee66 |
hex | 148bc8213a60 |
22590590630496 has 384 divisors, whose sum is σ = 70889914368000. Its totient is φ = 6163140372480.
The previous prime is 22590590630483. The next prime is 22590590630557. The reversal of 22590590630496 is 69403609509522.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3207520351 + ... + 3207527393.
It is an arithmetic number, because the mean of its divisors is an integer number (184609152000).
Almost surely, 222590590630496 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 22590590630496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35444957184000).
22590590630496 is an abundant number, since it is smaller than the sum of its proper divisors (48299323737504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22590590630496 is a wasteful number, since it uses less digits than its factorization.
22590590630496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9122 (or 9114 counting only the distinct ones).
The product of its (nonzero) digits is 31492800, while the sum is 60.
The spelling of 22590590630496 in words is "twenty-two trillion, five hundred ninety billion, five hundred ninety million, six hundred thirty thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •