Base | Representation |
---|---|
bin | 1100100101010… |
… | …1001011111101 |
3 | 10200022101102120 |
4 | 3021111023331 |
5 | 102002341400 |
6 | 5123113153 |
7 | 1210413630 |
oct | 311251375 |
9 | 120271376 |
10 | 52777725 |
11 | 27878760 |
12 | 158127b9 |
13 | ac1b830 |
14 | 701bc17 |
15 | 4977ca0 |
hex | 32552fd |
52777725 has 192 divisors, whose sum is σ = 126658560. Its totient is φ = 18662400.
The previous prime is 52777723. The next prime is 52777787.
52777725 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 52777725 - 21 = 52777723 is a prime.
Its product of digits (240100) is a multiple of the sum of its prime factors (100).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52777721) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1426407 + ... + 1426443.
It is an arithmetic number, because the mean of its divisors is an integer number (659680).
Almost surely, 252777725 is an apocalyptic number.
52777725 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52777725 is an abundant number, since it is smaller than the sum of its proper divisors (73880835).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52777725 is a wasteful number, since it uses less digits than its factorization.
52777725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 95 counting only the distinct ones).
The product of its digits is 240100, while the sum is 42.
The square root of 52777725 is about 7264.8279401511. The cubic root of 52777725 is about 375.1027274119.
It can be divided in two parts, 52 and 777725, that added together give a palindrome (777777).
The spelling of 52777725 in words is "fifty-two million, seven hundred seventy-seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •