Base | Representation |
---|---|
bin | 110001101101101… |
… | …1100100011000000 |
3 | 11022020220020210100 |
4 | 1203123130203000 |
5 | 11404020423300 |
6 | 433310002400 |
7 | 56223643410 |
oct | 14333344300 |
9 | 4266806710 |
10 | 1668139200 |
11 | 786691742 |
12 | 3a67a6400 |
13 | 2077a2620 |
14 | 11b790640 |
15 | 9b6ad700 |
hex | 636dc8c0 |
1668139200 has 1008 divisors, whose sum is σ = 7795889920. Its totient is φ = 328458240.
The previous prime is 1668139177. The next prime is 1668139217. The reversal of 1668139200 is 29318661.
It is a tau number, because it is divible by the number of its divisors (1008).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 24897567 + ... + 24897633.
Almost surely, 21668139200 is an apocalyptic number.
1668139200 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 1668139200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3897944960).
1668139200 is an abundant number, since it is smaller than the sum of its proper divisors (6127750720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1668139200 is a wasteful number, since it uses less digits than its factorization.
1668139200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134 (or 116 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 1668139200 is about 40842.8598411032. The cubic root of 1668139200 is about 1185.9801749760.
The spelling of 1668139200 in words is "one billion, six hundred sixty-eight million, one hundred thirty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •