Base | Representation |
---|---|
bin | 11100100010010011010101… |
… | …011011100001011100010101 |
3 | 121110100220221202121211120011 |
4 | 130202103111123201130111 |
5 | 112422213132414312442 |
6 | 1122531021503240221 |
7 | 35302154366226151 |
oct | 3442232533413425 |
9 | 543326852554504 |
10 | 125502525150997 |
11 | 36a9735a670515 |
12 | 120ab2918a9071 |
13 | 5504ab6835c97 |
14 | 22dc4d7156061 |
15 | e7991e503117 |
hex | 7224d56e1715 |
125502525150997 has 2 divisors, whose sum is σ = 125502525150998. Its totient is φ = 125502525150996.
The previous prime is 125502525150953. The next prime is 125502525151037. The reversal of 125502525150997 is 799051525205521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 115682737759281 + 9819787391716 = 10755591^2 + 3133654^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125502525150997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125502525120997) 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, 62751262575498 + 62751262575499.
It is an arithmetic number, because the mean of its divisors is an integer number (62751262575499).
Almost surely, 2125502525150997 is an apocalyptic number.
It is an amenable number.
125502525150997 is a deficient number, since it is larger than the sum of its proper divisors (1).
125502525150997 is an equidigital number, since it uses as much as digits as its factorization.
125502525150997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14175000, while the sum is 58.
The spelling of 125502525150997 in words is "one hundred twenty-five trillion, five hundred two billion, five hundred twenty-five million, one hundred fifty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •