Base | Representation |
---|---|
bin | 101000010001100… |
… | …001000110000000 |
3 | 1202002102010120220 |
4 | 220101201012000 |
5 | 2340433240030 |
6 | 151014103040 |
7 | 22513122255 |
oct | 5021410600 |
9 | 1662363526 |
10 | 675680640 |
11 | 317449958 |
12 | 16a34aa80 |
13 | a9ca5c3b |
14 | 65a4742c |
15 | 3e4bba10 |
hex | 28461180 |
675680640 has 256 divisors, whose sum is σ = 2312478720. Its totient is φ = 167215104.
The previous prime is 675680639. The next prime is 675680651. The reversal of 675680640 is 46086576.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 675680592 and 675680601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4145199 + ... + 4145361.
It is an arithmetic number, because the mean of its divisors is an integer number (9033120).
Almost surely, 2675680640 is an apocalyptic number.
675680640 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 675680640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1156239360).
675680640 is an abundant number, since it is smaller than the sum of its proper divisors (1636798080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675680640 is a wasteful number, since it uses less digits than its factorization.
675680640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 329 (or 317 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 42.
The square root of 675680640 is about 25993.8577360114. The cubic root of 675680640 is about 877.5000673696.
The spelling of 675680640 in words is "six hundred seventy-five million, six hundred eighty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •