Base | Representation |
---|---|
bin | 11111111001101011101110… |
… | …010101001000111101000111 |
3 | 200101202212121012021010221011 |
4 | 133321223232111020331013 |
5 | 121342212330423211442 |
6 | 1214222254154303051 |
7 | 41360405023363021 |
oct | 3771535625107507 |
9 | 611685535233834 |
10 | 140303400210247 |
11 | 4078337979785a |
12 | 1389b8a4a27a87 |
13 | 6039727b09a21 |
14 | 2690a13c53011 |
15 | 1134930445117 |
hex | 7f9aee548f47 |
140303400210247 has 2 divisors, whose sum is σ = 140303400210248. Its totient is φ = 140303400210246.
The previous prime is 140303400210187. The next prime is 140303400210299. The reversal of 140303400210247 is 742012004303041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140303400210247 - 211 = 140303400208199 is a prime.
It is a super-2 number, since 2×1403034002102472 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140303403210247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70151700105123 + 70151700105124.
It is an arithmetic number, because the mean of its divisors is an integer number (70151700105124).
Almost surely, 2140303400210247 is an apocalyptic number.
140303400210247 is a deficient number, since it is larger than the sum of its proper divisors (1).
140303400210247 is an equidigital number, since it uses as much as digits as its factorization.
140303400210247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 31.
Adding to 140303400210247 its reverse (742012004303041), we get a palindrome (882315404513288).
The spelling of 140303400210247 in words is "one hundred forty trillion, three hundred three billion, four hundred million, two hundred ten thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •