Base | Representation |
---|---|
bin | 100111111100100… |
… | …0010001010001001 |
3 | 10110102002220001211 |
4 | 1033321002022021 |
5 | 10221112213423 |
6 | 341000213121 |
7 | 45133540123 |
oct | 11771021211 |
9 | 3412086054 |
10 | 1340351113 |
11 | 6286586a2 |
12 | 314a6a1a1 |
13 | 1848c558a |
14 | ca026213 |
15 | 7ca1110d |
hex | 4fe42289 |
1340351113 has 2 divisors, whose sum is σ = 1340351114. Its totient is φ = 1340351112.
The previous prime is 1340351099. The next prime is 1340351137. The reversal of 1340351113 is 3111530431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 897122304 + 443228809 = 29952^2 + 21053^2 .
It is a cyclic number.
It is not a de Polignac number, because 1340351113 - 25 = 1340351081 is a prime.
It is a super-2 number, since 2×13403511132 = 3593082212240677538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1340351413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670175556 + 670175557.
It is an arithmetic number, because the mean of its divisors is an integer number (670175557).
Almost surely, 21340351113 is an apocalyptic number.
It is an amenable number.
1340351113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340351113 is an equidigital number, since it uses as much as digits as its factorization.
1340351113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 540, while the sum is 22.
The square root of 1340351113 is about 36610.8059594432. The cubic root of 1340351113 is about 1102.5700548002.
Adding to 1340351113 its reverse (3111530431), we get a palindrome (4451881544).
It can be divided in two parts, 13403 and 51113, that added together give a square (64516 = 2542).
The spelling of 1340351113 in words is "one billion, three hundred forty million, three hundred fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •