Base | Representation |
---|---|
bin | 100111110101011… |
… | …101100000010000 |
3 | 1201120120110210021 |
4 | 213311131200100 |
5 | 2332042412104 |
6 | 150152313224 |
7 | 22363451011 |
oct | 4765354020 |
9 | 1646513707 |
10 | 668325904 |
11 | 313286164 |
12 | 1679a2814 |
13 | a85cc41c |
14 | 64a91008 |
15 | 3da17754 |
hex | 27d5d810 |
668325904 has 45 divisors (see below), whose sum is σ = 1358462749. Its totient is φ = 318496640.
The previous prime is 668325901. The next prime is 668325907. The reversal of 668325904 is 409523866.
The square root of 668325904 is 25852.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (668325901) and next prime (668325907).
It can be written as a sum of positive squares in only one way, i.e., 451647504 + 216678400 = 21252^2 + 14720^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (668325901) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 2378244 + ... + 2378524.
Almost surely, 2668325904 is an apocalyptic number.
668325904 is the 25852-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 668325904
668325904 is an abundant number, since it is smaller than the sum of its proper divisors (690136845).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
668325904 is an equidigital number, since it uses as much as digits as its factorization.
668325904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616 (or 306 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 43.
The cubic root of 668325904 is about 874.3046029699.
The spelling of 668325904 in words is "six hundred sixty-eight million, three hundred twenty-five thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •