Base | Representation |
---|---|
bin | 100111111100000… |
… | …0100111011110001 |
3 | 10110101122011001211 |
4 | 1033320010323301 |
5 | 10221031202322 |
6 | 340551000121 |
7 | 45131444032 |
oct | 11770047361 |
9 | 3411564054 |
10 | 1340100337 |
11 | 6284a7244 |
12 | 314969041 |
13 | 1848383a4 |
14 | c9d9ca89 |
15 | 7c9b1b77 |
hex | 4fe04ef1 |
1340100337 has 2 divisors, whose sum is σ = 1340100338. Its totient is φ = 1340100336.
The previous prime is 1340100287. The next prime is 1340100367. The reversal of 1340100337 is 7330010431.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1287087376 + 53012961 = 35876^2 + 7281^2 .
It is an emirp because it is prime and its reverse (7330010431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1340100337 is a prime.
It is not a weakly prime, because it can be changed into another prime (1340100367) 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, 670050168 + 670050169.
It is an arithmetic number, because the mean of its divisors is an integer number (670050169).
Almost surely, 21340100337 is an apocalyptic number.
It is an amenable number.
1340100337 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340100337 is an equidigital number, since it uses as much as digits as its factorization.
1340100337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 1340100337 is about 36607.3809087730. The cubic root of 1340100337 is about 1102.5012879049.
Adding to 1340100337 its reverse (7330010431), we get a palindrome (8670110768).
The spelling of 1340100337 in words is "one billion, three hundred forty million, one hundred thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •