Base | Representation |
---|---|
bin | 110001010000101101… |
… | …101011101110101001 |
3 | 12001112020221102122220 |
4 | 301100231223232221 |
5 | 1331311300313200 |
6 | 40144332504253 |
7 | 3551520355032 |
oct | 612055535651 |
9 | 161466842586 |
10 | 52893760425 |
11 | 204831700a0 |
12 | a30201b089 |
13 | 4cac4376bc |
14 | 27bab9da89 |
15 | 15989504a0 |
hex | c50b6bba9 |
52893760425 has 24 divisors (see below), whose sum is σ = 95401111200. Its totient is φ = 25645459200.
The previous prime is 52893760391. The next prime is 52893760429. The reversal of 52893760425 is 52406739825.
It is a happy number.
It is not a de Polignac number, because 52893760425 - 220 = 52892711849 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (52893760429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 32056000 + ... + 32057649.
It is an arithmetic number, because the mean of its divisors is an integer number (3975046300).
Almost surely, 252893760425 is an apocalyptic number.
52893760425 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
52893760425 is a deficient number, since it is larger than the sum of its proper divisors (42507350775).
52893760425 is a wasteful number, since it uses less digits than its factorization.
52893760425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64113673 (or 64113668 counting only the distinct ones).
The product of its (nonzero) digits is 3628800, while the sum is 51.
It can be divided in two parts, 52893 and 760425, that added together give a palindrome (813318).
The spelling of 52893760425 in words is "fifty-two billion, eight hundred ninety-three million, seven hundred sixty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •