Base | Representation |
---|---|
bin | 100111111101001… |
… | …0011101110111101 |
3 | 10110102201212102002 |
4 | 1033322103232331 |
5 | 10221203411440 |
6 | 341011312045 |
7 | 45136431224 |
oct | 11772235675 |
9 | 3412655362 |
10 | 1340685245 |
11 | 628866739 |
12 | 314bab625 |
13 | 1849b16a3 |
14 | ca0b1cbb |
15 | 7ca7a115 |
hex | 4fe93bbd |
1340685245 has 8 divisors (see below), whose sum is σ = 1613434200. Its totient is φ = 1069473600.
The previous prime is 1340685233. The next prime is 1340685257. The reversal of 1340685245 is 5425860431.
It is an interprime number because it is at equal distance from previous prime (1340685233) and next prime (1340685257).
It can be written as a sum of positive squares in 4 ways, for example, as 420291001 + 920394244 = 20501^2 + 30338^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-1340685245 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1340685199 and 1340685208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 382406 + ... + 385895.
It is an arithmetic number, because the mean of its divisors is an integer number (201679275).
Almost surely, 21340685245 is an apocalyptic number.
It is an amenable number.
1340685245 is a deficient number, since it is larger than the sum of its proper divisors (272748955).
1340685245 is an equidigital number, since it uses as much as digits as its factorization.
1340685245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768655.
The product of its (nonzero) digits is 115200, while the sum is 38.
The square root of 1340685245 is about 36615.3689726049. The cubic root of 1340685245 is about 1102.6616659523.
The spelling of 1340685245 in words is "one billion, three hundred forty million, six hundred eighty-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •