Base | Representation |
---|---|
bin | 110001010011000001… |
… | …101010001111101010 |
3 | 12001121221221020020020 |
4 | 301103001222033222 |
5 | 1331401213123113 |
6 | 40152240141310 |
7 | 3552501160020 |
oct | 612301521752 |
9 | 161557836206 |
10 | 52932551658 |
11 | 204a3055568 |
12 | a313007836 |
13 | 4cb7499cac |
14 | 27c1dba710 |
15 | 159c064023 |
hex | c5306a3ea |
52932551658 has 64 divisors (see below), whose sum is σ = 125223874560. Its totient is φ = 14594715072.
The previous prime is 52932551593. The next prime is 52932551671. The reversal of 52932551658 is 85615523925.
It is a self number, because there is not a number n which added to its sum of digits gives 52932551658.
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 31 ways as a sum of consecutive naturals, for example, 2673391 + ... + 2693117.
It is an arithmetic number, because the mean of its divisors is an integer number (1956623040).
Almost surely, 252932551658 is an apocalyptic number.
52932551658 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 52932551658, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62611937280).
52932551658 is an abundant number, since it is smaller than the sum of its proper divisors (72291322902).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52932551658 is a wasteful number, since it uses less digits than its factorization.
52932551658 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21971.
The product of its digits is 3240000, while the sum is 51.
The spelling of 52932551658 in words is "fifty-two billion, nine hundred thirty-two million, five hundred fifty-one thousand, six hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •