Base | Representation |
---|---|
bin | 110010000100111… |
… | …1011000011111101 |
3 | 11100002211020120021 |
4 | 1210021323003331 |
5 | 11420130312223 |
6 | 434423052141 |
7 | 56432336221 |
oct | 14411730375 |
9 | 4302736507 |
10 | 1680322813 |
11 | 792553444 |
12 | 3aa8a1051 |
13 | 20a17a070 |
14 | 11d242781 |
15 | 9c7b865d |
hex | 6427b0fd |
1680322813 has 8 divisors (see below), whose sum is σ = 1812333600. Its totient is φ = 1548705648.
The previous prime is 1680322807. The next prime is 1680322837. The reversal of 1680322813 is 3182230861.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1680322813 - 213 = 1680314621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1680322873) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 89503 + ... + 106636.
It is an arithmetic number, because the mean of its divisors is an integer number (226541700).
Almost surely, 21680322813 is an apocalyptic number.
1680322813 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1680322813 is a deficient number, since it is larger than the sum of its proper divisors (132010787).
1680322813 is a wasteful number, since it uses less digits than its factorization.
1680322813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196811.
The product of its (nonzero) digits is 13824, while the sum is 34.
The square root of 1680322813 is about 40991.7407900665. The cubic root of 1680322813 is about 1188.8605275523.
The spelling of 1680322813 in words is "one billion, six hundred eighty million, three hundred twenty-two thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •