Base | Representation |
---|---|
bin | 100111110110000… |
… | …100101101111000 |
3 | 1201120212122010000 |
4 | 213312010231320 |
5 | 2332113032040 |
6 | 150155553000 |
7 | 22365020202 |
oct | 4766045570 |
9 | 1646778100 |
10 | 668486520 |
11 | 3133858a9 |
12 | 167a5b760 |
13 | a8657570 |
14 | 64ad3772 |
15 | 3da4a130 |
hex | 27d84b78 |
668486520 has 320 divisors, whose sum is σ = 2469852000. Its totient is φ = 161160192.
The previous prime is 668486501. The next prime is 668486549. The reversal of 668486520 is 25684866.
It is a hoax number, since the sum of its digits (45) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2484946 + ... + 2485214.
Almost surely, 2668486520 is an apocalyptic number.
668486520 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 668486520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1234926000).
668486520 is an abundant number, since it is smaller than the sum of its proper divisors (1801365480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668486520 is a wasteful number, since it uses less digits than its factorization.
668486520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 364 (or 351 counting only the distinct ones).
The product of its (nonzero) digits is 552960, while the sum is 45.
The square root of 668486520 is about 25855.1062654942. The cubic root of 668486520 is about 874.3746366962.
The spelling of 668486520 in words is "six hundred sixty-eight million, four hundred eighty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •