Base | Representation |
---|---|
bin | 10100011110000101110101… |
… | …010000110011000101000000 |
3 | 102210202200000020202200000000 |
4 | 110132011311100303011000 |
5 | 43300012413332013443 |
6 | 515250352113000000 |
7 | 24651236005502205 |
oct | 2436056520630500 |
9 | 383680006680000 |
10 | 90028776829248 |
11 | 2675aa98524974 |
12 | a12021b253000 |
13 | 3b308a5b3794a |
14 | 18335b78c9cac |
15 | a61cc5dde8d3 |
hex | 51e175433140 |
90028776829248 has 504 divisors, whose sum is σ = 273953695017600. Its totient is φ = 29340011538432.
The previous prime is 90028776829169. The next prime is 90028776829373. The reversal of 90028776829248 is 84292867782009.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
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 71 ways as a sum of consecutive naturals, for example, 25439042263 + ... + 25439045801.
Almost surely, 290028776829248 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 90028776829248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136976847508800).
90028776829248 is an abundant number, since it is smaller than the sum of its proper divisors (183924918188352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
90028776829248 is an equidigital number, since it uses as much as digits as its factorization.
90028776829248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4911 (or 4880 counting only the distinct ones).
The product of its (nonzero) digits is 390168576, while the sum is 72.
The spelling of 90028776829248 in words is "ninety trillion, twenty-eight billion, seven hundred seventy-six million, eight hundred twenty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •