Base | Representation |
---|---|
bin | 111010010001110111… |
… | …0110001011111110011 |
3 | 102222001011102022202011 |
4 | 1310203232301133303 |
5 | 4022303244444012 |
6 | 133254510103351 |
7 | 12020264220646 |
oct | 1644356613763 |
9 | 388034368664 |
10 | 125153515507 |
11 | 49093995649 |
12 | 203097aab57 |
13 | ba56aa6027 |
14 | 60b3969a5d |
15 | 33c76331a7 |
hex | 1d23bb17f3 |
125153515507 has 2 divisors, whose sum is σ = 125153515508. Its totient is φ = 125153515506.
The previous prime is 125153515481. The next prime is 125153515519. The reversal of 125153515507 is 705515351521.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125153515507 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 125153515507.
It is not a weakly prime, because it can be changed into another prime (125153515537) 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, 62576757753 + 62576757754.
It is an arithmetic number, because the mean of its divisors is an integer number (62576757754).
Almost surely, 2125153515507 is an apocalyptic number.
125153515507 is a deficient number, since it is larger than the sum of its proper divisors (1).
125153515507 is an equidigital number, since it uses as much as digits as its factorization.
125153515507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131250, while the sum is 40.
The spelling of 125153515507 in words is "one hundred twenty-five billion, one hundred fifty-three million, five hundred fifteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •