Base | Representation |
---|---|
bin | 101000111001111000101 |
3 | 2112002121212 |
4 | 11013033011 |
5 | 320342412 |
6 | 44421205 |
7 | 14251514 |
oct | 5071705 |
9 | 2462555 |
10 | 1340357 |
11 | 836037 |
12 | 547805 |
13 | 37c115 |
14 | 26c67b |
15 | 1b7222 |
hex | 1473c5 |
1340357 has 2 divisors, whose sum is σ = 1340358. Its totient is φ = 1340356.
The previous prime is 1340333. The next prime is 1340359. The reversal of 1340357 is 7530431.
It is a happy number.
1340357 is nontrivially palindromic in base 8.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1110916 + 229441 = 1054^2 + 479^2 .
It is an emirp because it is prime and its reverse (7530431) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1340357 - 210 = 1339333 is a prime.
Together with 1340359, it forms a pair of twin primes.
It is a Chen prime.
It is an Ulam number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1340359) 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, 670178 + 670179.
It is an arithmetic number, because the mean of its divisors is an integer number (670179).
21340357 is an apocalyptic number.
It is an amenable number.
1340357 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340357 is an equidigital number, since it uses as much as digits as its factorization.
1340357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 23.
The square root of 1340357 is about 1157.7378805239. The cubic root of 1340357 is about 110.2571669009.
Adding to 1340357 its reverse (7530431), we get a palindrome (8870788).
The spelling of 1340357 in words is "one million, three hundred forty thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •