Base | Representation |
---|---|
bin | 110011010001011100101 |
3 | 10011100122222 |
4 | 12122023211 |
5 | 412230401 |
6 | 100002125 |
7 | 20165153 |
oct | 6321345 |
9 | 3140588 |
10 | 1680101 |
11 | a48315 |
12 | 690345 |
13 | 46a957 |
14 | 31a3d3 |
15 | 232c1b |
hex | 19a2e5 |
1680101 has 2 divisors, whose sum is σ = 1680102. Its totient is φ = 1680100.
The previous prime is 1680089. The next prime is 1680103. The reversal of 1680101 is 1010861.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1288225 + 391876 = 1135^2 + 626^2 .
It is an emirp because it is prime and its reverse (1010861) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1680101 - 210 = 1679077 is a prime.
Together with 1680103, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1680101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1680103) 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, 840050 + 840051.
It is an arithmetic number, because the mean of its divisors is an integer number (840051).
21680101 is an apocalyptic number.
It is an amenable number.
1680101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1680101 is an equidigital number, since it uses as much as digits as its factorization.
1680101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 1680101 is about 1296.1871006919. The cubic root of 1680101 is about 118.8808212937.
Adding to 1680101 its reverse (1010861), we get a palindrome (2690962).
The spelling of 1680101 in words is "one million, six hundred eighty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •