Base | Representation |
---|---|
bin | 11100100010111000001111… |
… | …010101101011101000000101 |
3 | 121110111201020101102001121122 |
4 | 130202320033111223220011 |
5 | 112423340311224412122 |
6 | 1123001133531323325 |
7 | 35305056354636524 |
oct | 3442701725535005 |
9 | 543451211361548 |
10 | 125542151404037 |
11 | 37002144654975 |
12 | 120b6ab05b0545 |
13 | 55087603395a4 |
14 | 23003b5c344bb |
15 | e7a98d2b0142 |
hex | 722e0f56ba05 |
125542151404037 has 2 divisors, whose sum is σ = 125542151404038. Its totient is φ = 125542151404036.
The previous prime is 125542151404003. The next prime is 125542151404051. The reversal of 125542151404037 is 730404151245521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 119164273905121 + 6377877498916 = 10916239^2 + 2525446^2 .
It is a cyclic number.
It is not a de Polignac number, because 125542151404037 - 210 = 125542151403013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125542151404057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62771075702018 + 62771075702019.
It is an arithmetic number, because the mean of its divisors is an integer number (62771075702019).
Almost surely, 2125542151404037 is an apocalyptic number.
It is an amenable number.
125542151404037 is a deficient number, since it is larger than the sum of its proper divisors (1).
125542151404037 is an equidigital number, since it uses as much as digits as its factorization.
125542151404037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672000, while the sum is 44.
The spelling of 125542151404037 in words is "one hundred twenty-five trillion, five hundred forty-two billion, one hundred fifty-one million, four hundred four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •