Base | Representation |
---|---|
bin | 100111001011100… |
… | …0100011110011101 |
3 | 10101121210011212202 |
4 | 1032113010132131 |
5 | 10143023423433 |
6 | 334241541245 |
7 | 44402341403 |
oct | 11627043635 |
9 | 3347704782 |
10 | 1314670493 |
11 | 615108444 |
12 | 308344825 |
13 | 17c4a3646 |
14 | c685d473 |
15 | 7a63bee8 |
hex | 4e5c479d |
1314670493 has 2 divisors, whose sum is σ = 1314670494. Its totient is φ = 1314670492.
The previous prime is 1314670447. The next prime is 1314670499. The reversal of 1314670493 is 3940764131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 775176964 + 539493529 = 27842^2 + 23227^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1314670493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314670499) 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, 657335246 + 657335247.
It is an arithmetic number, because the mean of its divisors is an integer number (657335247).
Almost surely, 21314670493 is an apocalyptic number.
It is an amenable number.
1314670493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314670493 is an equidigital number, since it uses as much as digits as its factorization.
1314670493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 38.
The square root of 1314670493 is about 36258.3851405437. The cubic root of 1314670493 is about 1095.4829900862.
The spelling of 1314670493 in words is "one billion, three hundred fourteen million, six hundred seventy thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •