Base | Representation |
---|---|
bin | 1100100001111… |
… | …1100000111001 |
3 | 10122220012212012 |
4 | 3020133200321 |
5 | 101423323011 |
6 | 5114255305 |
7 | 1205506655 |
oct | 310374071 |
9 | 118805765 |
10 | 52557881 |
11 | 27738572 |
12 | 15727535 |
13 | ab7274c |
14 | 6da1a65 |
15 | 4932a8b |
hex | 321f839 |
52557881 has 2 divisors, whose sum is σ = 52557882. Its totient is φ = 52557880.
The previous prime is 52557851. The next prime is 52557887. The reversal of 52557881 is 18875525.
52557881 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., 27206656 + 25351225 = 5216^2 + 5035^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52557881 is a prime.
It is a super-2 number, since 2×525578812 = 5524661710420322, which contains 22 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 (52557887) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26278940 + 26278941.
It is an arithmetic number, because the mean of its divisors is an integer number (26278941).
Almost surely, 252557881 is an apocalyptic number.
It is an amenable number.
52557881 is a deficient number, since it is larger than the sum of its proper divisors (1).
52557881 is an equidigital number, since it uses as much as digits as its factorization.
52557881 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 112000, while the sum is 41.
The square root of 52557881 is about 7249.6814412773. The cubic root of 52557881 is about 374.5811762571.
The spelling of 52557881 in words is "fifty-two million, five hundred fifty-seven thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •