Base | Representation |
---|---|
bin | 1000001100010101111… |
… | …0010111001100010001 |
3 | 111110022020202200012102 |
4 | 2003011132113030101 |
5 | 4301230004234322 |
6 | 144354404210145 |
7 | 13111652316041 |
oct | 2030536271421 |
9 | 443266680172 |
10 | 140752024337 |
11 | 54768937161 |
12 | 23341699955 |
13 | 10371618002 |
14 | 6b53469721 |
15 | 39dbc6d792 |
hex | 20c5797311 |
140752024337 has 2 divisors, whose sum is σ = 140752024338. Its totient is φ = 140752024336.
The previous prime is 140752024319. The next prime is 140752024363. The reversal of 140752024337 is 733420257041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105489193681 + 35262830656 = 324791^2 + 187784^2 .
It is a cyclic number.
It is not a de Polignac number, because 140752024337 - 216 = 140751958801 is a prime.
It is a super-2 number, since 2×1407520243372 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 140752024337.
It is not a weakly prime, because it can be changed into another prime (140752024307) 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, 70376012168 + 70376012169.
It is an arithmetic number, because the mean of its divisors is an integer number (70376012169).
Almost surely, 2140752024337 is an apocalyptic number.
It is an amenable number.
140752024337 is a deficient number, since it is larger than the sum of its proper divisors (1).
140752024337 is an equidigital number, since it uses as much as digits as its factorization.
140752024337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 141120, while the sum is 38.
The spelling of 140752024337 in words is "one hundred forty billion, seven hundred fifty-two million, twenty-four thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •