Base | Representation |
---|---|
bin | 110010000101111… |
… | …1011110001110001 |
3 | 11100010211000202221 |
4 | 1210023323301301 |
5 | 11420244200113 |
6 | 434442241041 |
7 | 56436663262 |
oct | 14413736161 |
9 | 4303730687 |
10 | 1680850033 |
11 | 792883565 |
12 | 3aaab6181 |
13 | 20a303025 |
14 | 11d33c969 |
15 | 9c86e98d |
hex | 642fbc71 |
1680850033 has 2 divisors, whose sum is σ = 1680850034. Its totient is φ = 1680850032.
The previous prime is 1680850021. The next prime is 1680850139. The reversal of 1680850033 is 3300580861.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1478556304 + 202293729 = 38452^2 + 14223^2 .
It is an emirp because it is prime and its reverse (3300580861) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1680850033 - 229 = 1143979121 is a prime.
It is a super-2 number, since 2×16808500332 = 5650513666872202178, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1680853033) 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 as a sum of consecutive naturals, namely, 840425016 + 840425017.
It is an arithmetic number, because the mean of its divisors is an integer number (840425017).
Almost surely, 21680850033 is an apocalyptic number.
It is an amenable number.
1680850033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1680850033 is an equidigital number, since it uses as much as digits as its factorization.
1680850033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 1680850033 is about 40998.1710933549. The cubic root of 1680850033 is about 1188.9848539615.
The spelling of 1680850033 in words is "one billion, six hundred eighty million, eight hundred fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •