Base | Representation |
---|---|
bin | 100001101110011000… |
… | …1111110000101101100 |
3 | 20220221022201020011110 |
4 | 1003130301332011230 |
5 | 2141310413014003 |
6 | 53134304152020 |
7 | 5142503063553 |
oct | 1033461760554 |
9 | 226838636143 |
10 | 72423563628 |
11 | 28795239319 |
12 | 12052608610 |
13 | 6aa2593780 |
14 | 371084ad9a |
15 | 1d3d28da03 |
hex | 10dcc7e16c |
72423563628 has 96 divisors (see below), whose sum is σ = 188123471872. Its totient is φ = 21534854400.
The previous prime is 72423563609. The next prime is 72423563647. The reversal of 72423563628 is 82636532427.
It is an interprime number because it is at equal distance from previous prime (72423563609) and next prime (72423563647).
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 31 ways as a sum of consecutive naturals, for example, 3534573 + ... + 3555003.
Almost surely, 272423563628 is an apocalyptic number.
72423563628 is a gapful number since it is divisible by the number (78) 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 72423563628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94061735936).
72423563628 is an abundant number, since it is smaller than the sum of its proper divisors (115699908244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
72423563628 is a wasteful number, since it uses less digits than its factorization.
72423563628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21215 (or 21213 counting only the distinct ones).
The product of its digits is 2903040, while the sum is 48.
The spelling of 72423563628 in words is "seventy-two billion, four hundred twenty-three million, five hundred sixty-three thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •