Base | Representation |
---|---|
bin | 1000001011000001110… |
… | …0101110001010110011 |
3 | 111102101200000000211021 |
4 | 2002300130232022303 |
5 | 4300014203211002 |
6 | 144255403400311 |
7 | 13100140061305 |
oct | 2026034561263 |
9 | 442350000737 |
10 | 140399272627 |
11 | 545a7802619 |
12 | 23263523097 |
13 | 1031650a4a3 |
14 | 6b1c683975 |
15 | 39bacde737 |
hex | 20b072e2b3 |
140399272627 has 2 divisors, whose sum is σ = 140399272628. Its totient is φ = 140399272626.
The previous prime is 140399272571. The next prime is 140399272639. The reversal of 140399272627 is 726272993041.
It is a strong prime.
It is an emirp because it is prime and its reverse (726272993041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 140399272627 - 211 = 140399270579 is a prime.
It is a super-2 number, since 2×1403992726272 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140399272667) 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, 70199636313 + 70199636314.
It is an arithmetic number, because the mean of its divisors is an integer number (70199636314).
Almost surely, 2140399272627 is an apocalyptic number.
140399272627 is a deficient number, since it is larger than the sum of its proper divisors (1).
140399272627 is an equidigital number, since it uses as much as digits as its factorization.
140399272627 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 52.
The spelling of 140399272627 in words is "one hundred forty billion, three hundred ninety-nine million, two hundred seventy-two thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •