Base | Representation |
---|---|
bin | 110010000010110… |
… | …1000111010110000 |
3 | 11100000201012020122 |
4 | 1210011220322300 |
5 | 11414333344140 |
6 | 434343025412 |
7 | 56416651406 |
oct | 14405507260 |
9 | 4300635218 |
10 | 1679199920 |
11 | 791956832 |
12 | 3aa43b268 |
13 | 209b75c28 |
14 | 11d02d476 |
15 | 9c645ab5 |
hex | 64168eb0 |
1679199920 has 80 divisors (see below), whose sum is σ = 3962103552. Its totient is φ = 661789440.
The previous prime is 1679199919. The next prime is 1679199943. The reversal of 1679199920 is 299919761.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1707749 + ... + 1708731.
Almost surely, 21679199920 is an apocalyptic number.
1679199920 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 1679199920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1981051776).
1679199920 is an abundant number, since it is smaller than the sum of its proper divisors (2282903632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1679199920 is a wasteful number, since it uses less digits than its factorization.
1679199920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290 (or 1284 counting only the distinct ones).
The product of its (nonzero) digits is 551124, while the sum is 53.
The square root of 1679199920 is about 40978.0419249139. The cubic root of 1679199920 is about 1188.5956457824.
The spelling of 1679199920 in words is "one billion, six hundred seventy-nine million, one hundred ninety-nine thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •