Base | Representation |
---|---|
bin | 110011100101011001001 |
3 | 10011212200012 |
4 | 12130223021 |
5 | 413042223 |
6 | 100121305 |
7 | 20240012 |
oct | 6345311 |
9 | 3155605 |
10 | 1690313 |
11 | a54a59 |
12 | 696235 |
13 | 4724b1 |
14 | 320009 |
15 | 235c78 |
hex | 19cac9 |
1690313 has 2 divisors, whose sum is σ = 1690314. Its totient is φ = 1690312.
The previous prime is 1690309. The next prime is 1690319. The reversal of 1690313 is 3130961.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1507984 + 182329 = 1228^2 + 427^2 .
It is an emirp because it is prime and its reverse (3130961) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1690313 - 22 = 1690309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p127454 and since 1690313 and 127454 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (1690319) 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, 845156 + 845157.
It is an arithmetic number, because the mean of its divisors is an integer number (845157).
21690313 is an apocalyptic number.
It is an amenable number.
1690313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1690313 is an equidigital number, since it uses as much as digits as its factorization.
1690313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The square root of 1690313 is about 1300.1203790419. The cubic root of 1690313 is about 119.1211956422.
The spelling of 1690313 in words is "one million, six hundred ninety thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •