Base | Representation |
---|---|
bin | 10011111100010111000… |
… | …10010010101100100000 |
3 | 2102111201121111111111110 |
4 | 21332023202102230200 |
5 | 42211333122310220 |
6 | 1242443440543320 |
7 | 100335622613460 |
oct | 11761342225440 |
9 | 2374647444443 |
10 | 685240822560 |
11 | 244677642198 |
12 | b0979921b40 |
13 | 4c80579c258 |
14 | 2524708bba0 |
15 | 12c584b2be0 |
hex | 9f8b892b20 |
685240822560 has 384 divisors, whose sum is σ = 2637358424064. Its totient is φ = 145980702720.
The previous prime is 685240822523. The next prime is 685240822571. The reversal of 685240822560 is 65228042586.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5825125 + ... + 5941595.
It is an arithmetic number, because the mean of its divisors is an integer number (6868120896).
Almost surely, 2685240822560 is an apocalyptic number.
685240822560 is a gapful number since it is divisible by the number (60) 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 685240822560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1318679212032).
685240822560 is an abundant number, since it is smaller than the sum of its proper divisors (1952117601504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
685240822560 is a wasteful number, since it uses less digits than its factorization.
685240822560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116616 (or 116608 counting only the distinct ones).
The product of its (nonzero) digits is 1843200, while the sum is 48.
The spelling of 685240822560 in words is "six hundred eighty-five billion, two hundred forty million, eight hundred twenty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •