Base | Representation |
---|---|
bin | 11111111000110100101101… |
… | …101101110110100000001011 |
3 | 200101120020010202222101210202 |
4 | 133320310231231312200023 |
5 | 121340230344013020411 |
6 | 1214135205131002415 |
7 | 41353214223666164 |
oct | 3770645555664013 |
9 | 611506122871722 |
10 | 140244334110731 |
11 | 40760319496a84 |
12 | 1389035b89940b |
13 | 6033ca39b5696 |
14 | 268bc0d42276b |
15 | 1133124bb883b |
hex | 7f8d2db7680b |
140244334110731 has 2 divisors, whose sum is σ = 140244334110732. Its totient is φ = 140244334110730.
The previous prime is 140244334110721. The next prime is 140244334110733. The reversal of 140244334110731 is 137011433442041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140244334110731 - 230 = 140243260368907 is a prime.
It is a super-2 number, since 2×1402443341107312 (a number of 29 digits) contains 22 as substring.
Together with 140244334110733, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (140244334110733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70122167055365 + 70122167055366.
It is an arithmetic number, because the mean of its divisors is an integer number (70122167055366).
Almost surely, 2140244334110731 is an apocalyptic number.
140244334110731 is a deficient number, since it is larger than the sum of its proper divisors (1).
140244334110731 is an equidigital number, since it uses as much as digits as its factorization.
140244334110731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
Adding to 140244334110731 its reverse (137011433442041), we get a palindrome (277255767552772).
The spelling of 140244334110731 in words is "one hundred forty trillion, two hundred forty-four billion, three hundred thirty-four million, one hundred ten thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •