Base | Representation |
---|---|
bin | 110000100001110100… |
… | …011011110110011001 |
3 | 11222111102111220221212 |
4 | 300201310123312121 |
5 | 1323203343014431 |
6 | 35534305512505 |
7 | 3523155126341 |
oct | 604164336631 |
9 | 158442456855 |
10 | 52107001241 |
11 | 2010a053299 |
12 | a122642735 |
13 | 4bb543c519 |
14 | 27444bdd21 |
15 | 154e84172b |
hex | c21d1bd99 |
52107001241 has 2 divisors, whose sum is σ = 52107001242. Its totient is φ = 52107001240.
The previous prime is 52107001123. The next prime is 52107001273. The reversal of 52107001241 is 14210070125.
52107001241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 49802617225 + 2304384016 = 223165^2 + 48004^2 .
It is a cyclic number.
It is not a de Polignac number, because 52107001241 - 214 = 52106984857 is a prime.
It is a super-3 number, since 3×521070012413 (a number of 33 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (52107000241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26053500620 + 26053500621.
It is an arithmetic number, because the mean of its divisors is an integer number (26053500621).
Almost surely, 252107001241 is an apocalyptic number.
It is an amenable number.
52107001241 is a deficient number, since it is larger than the sum of its proper divisors (1).
52107001241 is an equidigital number, since it uses as much as digits as its factorization.
52107001241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 560, while the sum is 23.
Adding to 52107001241 its reverse (14210070125), we get a palindrome (66317071366).
The spelling of 52107001241 in words is "fifty-two billion, one hundred seven million, one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •