Base | Representation |
---|---|
bin | 1000001010011010101… |
… | …0000110000111100101 |
3 | 111101222012220102222022 |
4 | 2002212222012013211 |
5 | 4244200130201222 |
6 | 144231214512525 |
7 | 13063103613161 |
oct | 2024652060745 |
9 | 441865812868 |
10 | 140235006437 |
11 | 54523006a39 |
12 | 23218505745 |
13 | 102bb484c66 |
14 | 6b04923ca1 |
15 | 39ab693042 |
hex | 20a6a861e5 |
140235006437 has 2 divisors, whose sum is σ = 140235006438. Its totient is φ = 140235006436.
The previous prime is 140235006403. The next prime is 140235006473. The reversal of 140235006437 is 734600532041.
Together with next prime (140235006473) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126071864356 + 14163142081 = 355066^2 + 119009^2 .
It is a cyclic number.
It is not a de Polignac number, because 140235006437 - 210 = 140235005413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140235006397 and 140235006406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (140235006337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70117503218 + 70117503219.
It is an arithmetic number, because the mean of its divisors is an integer number (70117503219).
Almost surely, 2140235006437 is an apocalyptic number.
It is an amenable number.
140235006437 is a deficient number, since it is larger than the sum of its proper divisors (1).
140235006437 is an equidigital number, since it uses as much as digits as its factorization.
140235006437 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 60480, while the sum is 35.
Adding to 140235006437 its reverse (734600532041), we get a palindrome (874835538478).
The spelling of 140235006437 in words is "one hundred forty billion, two hundred thirty-five million, six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •