Base | Representation |
---|---|
bin | 110000110011011000… |
… | …010000101111111001 |
3 | 12000020221212101012100 |
4 | 300303120100233321 |
5 | 1324304302340000 |
6 | 40023432134013 |
7 | 3533363204265 |
oct | 606330205771 |
9 | 160227771170 |
10 | 52401605625 |
11 | 20250381996 |
12 | a1a5237309 |
13 | 4c3149b445 |
14 | 277168b0a5 |
15 | 156a636a00 |
hex | c33610bf9 |
52401605625 has 60 divisors (see below), whose sum is σ = 97635146752. Its totient is φ = 27045900000.
The previous prime is 52401605621. The next prime is 52401605629. The reversal of 52401605625 is 52650610425.
52401605625 is a `hidden beast` number, since 5 + 2 + 40 + 1 + 605 + 6 + 2 + 5 = 666.
52401605625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (52401605621) and next prime (52401605629).
It is not a de Polignac number, because 52401605625 - 22 = 52401605621 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52401605625.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52401605621) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 24120 + ... + 324630.
Almost surely, 252401605625 is an apocalyptic number.
It is an amenable number.
52401605625 is a deficient number, since it is larger than the sum of its proper divisors (45233541127).
52401605625 is a wasteful number, since it uses less digits than its factorization.
52401605625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 300568 (or 300550 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The spelling of 52401605625 in words is "fifty-two billion, four hundred one million, six hundred five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •