Base | Representation |
---|---|
bin | 10011101101100001… |
… | …11111011001101000 |
3 | 1000022111211010101012 |
4 | 21312300333121220 |
5 | 133133104114210 |
6 | 4510031243052 |
7 | 523146445451 |
oct | 116660773150 |
9 | 30274733335 |
10 | 10582488680 |
11 | 45405a2415 |
12 | 2074079488 |
13 | cc859462a |
14 | 72566c128 |
15 | 41e0bc305 |
hex | 276c3f668 |
10582488680 has 32 divisors (see below), whose sum is σ = 24391349640. Its totient is φ = 4129751040.
The previous prime is 10582488671. The next prime is 10582488703. The reversal of 10582488680 is 8688428501.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2948272804 + 7634215876 = 54298^2 + 87374^2 .
It is a super-2 number, since 2×105824886802 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (50) coincides with the sum of the digits of its prime factors.
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 7 ways as a sum of consecutive naturals, for example, 3224729 + ... + 3228008.
Almost surely, 210582488680 is an apocalyptic number.
10582488680 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10582488680 is an abundant number, since it is smaller than the sum of its proper divisors (13808860960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10582488680 is a wasteful number, since it uses less digits than its factorization.
10582488680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6452789 (or 6452785 counting only the distinct ones).
The product of its (nonzero) digits is 983040, while the sum is 50.
The spelling of 10582488680 in words is "ten billion, five hundred eighty-two million, four hundred eighty-eight thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •