Base | Representation |
---|---|
bin | 100111111100001… |
… | …1110110000100101 |
3 | 10110101211112011121 |
4 | 1033320132300211 |
5 | 10221043043432 |
6 | 340553133541 |
7 | 45132364315 |
oct | 11770366045 |
9 | 3411745147 |
10 | 1340206117 |
11 | 628569768 |
12 | 3149ba2b1 |
13 | 184874593 |
14 | c9dc9445 |
15 | 7c9d3197 |
hex | 4fe1ec25 |
1340206117 has 2 divisors, whose sum is σ = 1340206118. Its totient is φ = 1340206116.
The previous prime is 1340206079. The next prime is 1340206129. The reversal of 1340206117 is 7116020431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1236858561 + 103347556 = 35169^2 + 10166^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340206117 - 215 = 1340173349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1340206091 and 1340206100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1340206817) 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, 670103058 + 670103059.
It is an arithmetic number, because the mean of its divisors is an integer number (670103059).
Almost surely, 21340206117 is an apocalyptic number.
It is an amenable number.
1340206117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340206117 is an equidigital number, since it uses as much as digits as its factorization.
1340206117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 25.
The square root of 1340206117 is about 36608.8256708679. The cubic root of 1340206117 is about 1102.5302955632.
Adding to 1340206117 its reverse (7116020431), we get a palindrome (8456226548).
The spelling of 1340206117 in words is "one billion, three hundred forty million, two hundred six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •