Base | Representation |
---|---|
bin | 11111111001110010110101… |
… | …101011011001111100110011 |
3 | 200101210121022121021102201201 |
4 | 133321302311223121330303 |
5 | 121342324002124232212 |
6 | 1214230000214512031 |
7 | 41361065235661336 |
oct | 3771626553317463 |
9 | 611717277242651 |
10 | 140311039680307 |
11 | 40786639aa8781 |
12 | 138a1277365617 |
13 | 603a37474ab02 |
14 | 269113a6ac61d |
15 | 1134c2ae76b57 |
hex | 7f9cb5ad9f33 |
140311039680307 has 2 divisors, whose sum is σ = 140311039680308. Its totient is φ = 140311039680306.
The previous prime is 140311039680247. The next prime is 140311039680359. The reversal of 140311039680307 is 703086930113041.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-140311039680307 is a prime.
It is a super-2 number, since 2×1403110396803072 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140311039680367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70155519840153 + 70155519840154.
It is an arithmetic number, because the mean of its divisors is an integer number (70155519840154).
Almost surely, 2140311039680307 is an apocalyptic number.
140311039680307 is a deficient number, since it is larger than the sum of its proper divisors (1).
140311039680307 is an equidigital number, since it uses as much as digits as its factorization.
140311039680307 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 326592, while the sum is 46.
Adding to 140311039680307 its reverse (703086930113041), we get a palindrome (843397969793348).
The spelling of 140311039680307 in words is "one hundred forty trillion, three hundred eleven billion, thirty-nine million, six hundred eighty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •