Base | Representation |
---|---|
bin | 111010111000001101… |
… | …1111011001110001101 |
3 | 110002100211221212011022 |
4 | 1311300123323032031 |
5 | 4032422221421422 |
6 | 134030321003525 |
7 | 12064211560535 |
oct | 1656033731615 |
9 | 402324855138 |
10 | 126440420237 |
11 | 4969435917a |
12 | 206087835a5 |
13 | bc005a7611 |
14 | 619683c4c5 |
15 | 34505d8342 |
hex | 1d706fb38d |
126440420237 has 2 divisors, whose sum is σ = 126440420238. Its totient is φ = 126440420236.
The previous prime is 126440420207. The next prime is 126440420269. The reversal of 126440420237 is 732024044621.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115968172681 + 10472247556 = 340541^2 + 102334^2 .
It is an emirp because it is prime and its reverse (732024044621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126440420237 - 220 = 126439371661 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 126440420197 and 126440420206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126440420207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63220210118 + 63220210119.
It is an arithmetic number, because the mean of its divisors is an integer number (63220210119).
Almost surely, 2126440420237 is an apocalyptic number.
It is an amenable number.
126440420237 is a deficient number, since it is larger than the sum of its proper divisors (1).
126440420237 is an equidigital number, since it uses as much as digits as its factorization.
126440420237 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64512, while the sum is 35.
Adding to 126440420237 its reverse (732024044621), we get a palindrome (858464464858).
The spelling of 126440420237 in words is "one hundred twenty-six billion, four hundred forty million, four hundred twenty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •