Base | Representation |
---|---|
bin | 111010010011010001… |
… | …0000100001011101101 |
3 | 102222011102212012001112 |
4 | 1310212202010023231 |
5 | 4022402313001241 |
6 | 133303305321405 |
7 | 12021404553053 |
oct | 1644642041355 |
9 | 388142765045 |
10 | 125200515821 |
11 | 49108477687 |
12 | 20321496265 |
13 | ba63750c74 |
14 | 60b9cc21d3 |
15 | 33cb8191eb |
hex | 1d268842ed |
125200515821 has 2 divisors, whose sum is σ = 125200515822. Its totient is φ = 125200515820.
The previous prime is 125200515809. The next prime is 125200515823. The reversal of 125200515821 is 128515002521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101588812900 + 23611702921 = 318730^2 + 153661^2 .
It is an emirp because it is prime and its reverse (128515002521) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 125200515821 - 218 = 125200253677 is a prime.
Together with 125200515823, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125200515823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62600257910 + 62600257911.
It is an arithmetic number, because the mean of its divisors is an integer number (62600257911).
Almost surely, 2125200515821 is an apocalyptic number.
It is an amenable number.
125200515821 is a deficient number, since it is larger than the sum of its proper divisors (1).
125200515821 is an equidigital number, since it uses as much as digits as its factorization.
125200515821 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8000, while the sum is 32.
The spelling of 125200515821 in words is "one hundred twenty-five billion, two hundred million, five hundred fifteen thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •