Base | Representation |
---|---|
bin | 110001100100011100… |
… | …011111001101100001 |
3 | 12002101022211211111201 |
4 | 301210130133031201 |
5 | 1333001022001100 |
6 | 40241240041201 |
7 | 3562650211231 |
oct | 614434371541 |
9 | 162338754451 |
10 | 53224797025 |
11 | 20633012864 |
12 | a394a63201 |
13 | 5032bb124a |
14 | 280cb31cc1 |
15 | 15b7a4036a |
hex | c6471f361 |
53224797025 has 9 divisors (see below), whose sum is σ = 66000178713. Its totient is φ = 42578914800.
The previous prime is 53224797013. The next prime is 53224797029. The reversal of 53224797025 is 52079742235.
The square root of 53224797025 is 230705.
It is a perfect power (a square), and thus also a powerful number.
53224797025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 19829427489 + 33395369536 = 140817^2 + 182744^2 .
It is not a de Polignac number, because 53224797025 - 213 = 53224788833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (53224797029) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1130455 + ... + 1176595.
Almost surely, 253224797025 is an apocalyptic number.
53224797025 is the 230705-th square number.
53224797025 is the 115353-rd centered octagonal number.
It is an amenable number.
53224797025 is a deficient number, since it is larger than the sum of its proper divisors (12775381688).
53224797025 is an frugal number, since it uses more digits than its factorization.
53224797025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92292 (or 46146 counting only the distinct ones).
The product of its (nonzero) digits is 1058400, while the sum is 46.
The spelling of 53224797025 in words is "fifty-three billion, two hundred twenty-four million, seven hundred ninety-seven thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •