Base | Representation |
---|---|
bin | 110010000110001… |
… | …0000010100011001 |
3 | 11100010222022012002 |
4 | 1210030100110121 |
5 | 11420304343134 |
6 | 434444130345 |
7 | 56440463465 |
oct | 14414202431 |
9 | 4303868162 |
10 | 1680934169 |
11 | 7929307a2 |
12 | 3aab369b5 |
13 | 20a332405 |
14 | 11d3614a5 |
15 | 9c88987e |
hex | 64310519 |
1680934169 has 2 divisors, whose sum is σ = 1680934170. Its totient is φ = 1680934168.
The previous prime is 1680934141. The next prime is 1680934183. The reversal of 1680934169 is 9614390861.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1679934169 + 1000000 = 40987^2 + 1000^2 .
It is an emirp because it is prime and its reverse (9614390861) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1680934169 - 216 = 1680868633 is a prime.
It is a super-2 number, since 2×16809341692 = 5651079361023441122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1680931169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 840467084 + 840467085.
It is an arithmetic number, because the mean of its divisors is an integer number (840467085).
Almost surely, 21680934169 is an apocalyptic number.
It is an amenable number.
1680934169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1680934169 is an equidigital number, since it uses as much as digits as its factorization.
1680934169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 47.
The square root of 1680934169 is about 40999.1971750667. The cubic root of 1680934169 is about 1189.0046920907.
The spelling of 1680934169 in words is "one billion, six hundred eighty million, nine hundred thirty-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •