Base | Representation |
---|---|
bin | 100111110100100… |
… | …111100000110000 |
3 | 1201120011020102110 |
4 | 213310213200300 |
5 | 2332013323002 |
6 | 150143445320 |
7 | 22361540160 |
oct | 4764474060 |
9 | 1646136373 |
10 | 668104752 |
11 | 313144a97 |
12 | 1678b6840 |
13 | a8552873 |
14 | 64a345a0 |
15 | 3d9c1e6c |
hex | 27d27830 |
668104752 has 160 divisors (see below), whose sum is σ = 2089945600. Its totient is φ = 179656704.
The previous prime is 668104741. The next prime is 668104763. The reversal of 668104752 is 257401866.
It is an interprime number because it is at equal distance from previous prime (668104741) and next prime (668104763).
It is a self number, because there is not a number n which added to its sum of digits gives 668104752.
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, 1461708 + ... + 1462164.
It is an arithmetic number, because the mean of its divisors is an integer number (13062160).
Almost surely, 2668104752 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 668104752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1044972800).
668104752 is an abundant number, since it is smaller than the sum of its proper divisors (1421840848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668104752 is a wasteful number, since it uses less digits than its factorization.
668104752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 723 (or 717 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 39.
The square root of 668104752 is about 25847.7223754821. The cubic root of 668104752 is about 874.2081552431.
The spelling of 668104752 in words is "six hundred sixty-eight million, one hundred four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •