Base | Representation |
---|---|
bin | 100111111011111… |
… | …0101010010000111 |
3 | 10110101111220010112 |
4 | 1033313311102013 |
5 | 10221022124411 |
6 | 340545343235 |
7 | 45131056112 |
oct | 11767652207 |
9 | 3411456115 |
10 | 1340036231 |
11 | 628463066 |
12 | 314937b1b |
13 | 184815161 |
14 | c9d83579 |
15 | 7c99cb8b |
hex | 4fdf5487 |
1340036231 has 2 divisors, whose sum is σ = 1340036232. Its totient is φ = 1340036230.
The previous prime is 1340036209. The next prime is 1340036239. The reversal of 1340036231 is 1326300431.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1340036231 - 214 = 1340019847 is a prime.
It is a super-3 number, since 3×13400362313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1340036197 and 1340036206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1340036239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 670018115 + 670018116.
It is an arithmetic number, because the mean of its divisors is an integer number (670018116).
Almost surely, 21340036231 is an apocalyptic number.
1340036231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1340036231 is an equidigital number, since it uses as much as digits as its factorization.
1340036231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 1340036231 is about 36606.5053098490. The cubic root of 1340036231 is about 1102.4837076107.
Adding to 1340036231 its reverse (1326300431), we get a palindrome (2666336662).
The spelling of 1340036231 in words is "one billion, three hundred forty million, thirty-six thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •