Base | Representation |
---|---|
bin | 110001101110011… |
… | …1010101111001000 |
3 | 11022021121212000020 |
4 | 1203130322233020 |
5 | 11404120300000 |
6 | 433322140440 |
7 | 56230141242 |
oct | 14334725710 |
9 | 4267555006 |
10 | 1668525000 |
11 | 78692558a |
12 | 3a6951720 |
13 | 2078a90cc |
14 | 11b851092 |
15 | 9b737ba0 |
hex | 6373abc8 |
1668525000 has 96 divisors (see below), whose sum is σ = 5214041280. Its totient is φ = 444920000.
The previous prime is 1668524987. The next prime is 1668525017. The reversal of 1668525000 is 5258661.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63877 + ... + 86123.
It is an arithmetic number, because the mean of its divisors is an integer number (54312930).
Almost surely, 21668525000 is an apocalyptic number.
1668525000 is a gapful number since it is divisible by the number (10) 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 1668525000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2607020640).
1668525000 is an abundant number, since it is smaller than the sum of its proper divisors (3545516280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1668525000 is an equidigital number, since it uses as much as digits as its factorization.
1668525000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22281 (or 22257 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 33.
The square root of 1668525000 is about 40847.5825478081. The cubic root of 1668525000 is about 1186.0715973790.
The spelling of 1668525000 in words is "one billion, six hundred sixty-eight million, five hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •