Base | Representation |
---|---|
bin | 111010101111111100… |
… | …0100111011100101101 |
3 | 110001122111102200001101 |
4 | 1311133320213130231 |
5 | 4031340124304444 |
6 | 133543001043101 |
7 | 12054300333421 |
oct | 1653770473455 |
9 | 401574380041 |
10 | 126162728749 |
11 | 49561631482 |
12 | 2054b786491 |
13 | bb87bba925 |
14 | 616b9d4b81 |
15 | 34360343d4 |
hex | 1d5fe2772d |
126162728749 has 2 divisors, whose sum is σ = 126162728750. Its totient is φ = 126162728748.
The previous prime is 126162728701. The next prime is 126162728789. The reversal of 126162728749 is 947827261621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113715979524 + 12446749225 = 337218^2 + 111565^2 .
It is an emirp because it is prime and its reverse (947827261621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126162728749 - 213 = 126162720557 is a prime.
It is a super-2 number, since 2×1261627287492 (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 126162728749.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126162728789) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63081364374 + 63081364375.
It is an arithmetic number, because the mean of its divisors is an integer number (63081364375).
Almost surely, 2126162728749 is an apocalyptic number.
It is an amenable number.
126162728749 is a deficient number, since it is larger than the sum of its proper divisors (1).
126162728749 is an equidigital number, since it uses as much as digits as its factorization.
126162728749 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4064256, while the sum is 55.
The spelling of 126162728749 in words is "one hundred twenty-six billion, one hundred sixty-two million, seven hundred twenty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •