Base | Representation |
---|---|
bin | 11111110101100111101000… |
… | …100101110001000010111111 |
3 | 200100210011202110000221100122 |
4 | 133311213220211301002333 |
5 | 121323123410020444411 |
6 | 1213450110414445155 |
7 | 41331260333463566 |
oct | 3765475045610277 |
9 | 610704673027318 |
10 | 140024131031231 |
11 | 4068599a600167 |
12 | 138557462037bb |
13 | 60192acbc69c5 |
14 | 26812c00b4bdd |
15 | 112c537c619db |
hex | 7f59e89710bf |
140024131031231 has 2 divisors, whose sum is σ = 140024131031232. Its totient is φ = 140024131031230.
The previous prime is 140024131031219. The next prime is 140024131031237. The reversal of 140024131031231 is 132130131420041.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 140024131031231 - 238 = 139749253124287 is a prime.
It is a super-2 number, since 2×1400241310312312 (a number of 29 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 140024131031231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140024131031237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70012065515615 + 70012065515616.
It is an arithmetic number, because the mean of its divisors is an integer number (70012065515616).
Almost surely, 2140024131031231 is an apocalyptic number.
140024131031231 is a deficient number, since it is larger than the sum of its proper divisors (1).
140024131031231 is an equidigital number, since it uses as much as digits as its factorization.
140024131031231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 140024131031231 its reverse (132130131420041), we get a palindrome (272154262451272).
The spelling of 140024131031231 in words is "one hundred forty trillion, twenty-four billion, one hundred thirty-one million, thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •