Base | Representation |
---|---|
bin | 110000101010110010… |
… | …100011011001010001 |
3 | 11222212220201012021201 |
4 | 300222302203121101 |
5 | 1324010410042201 |
6 | 40001243351201 |
7 | 3526663305400 |
oct | 605262433121 |
9 | 158786635251 |
10 | 52257502801 |
11 | 20186aa8349 |
12 | a164b22501 |
13 | 4c0a6857ba |
14 | 275a499637 |
15 | 155cb6e801 |
hex | c2aca3651 |
52257502801 has 45 divisors (see below), whose sum is σ = 65165267271. Its totient is φ = 41784239616.
The previous prime is 52257502771. The next prime is 52257502831. The reversal of 52257502801 is 10820575225.
The square root of 52257502801 is 228599.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (52257502771) and next prime (52257502831).
It can be written as a sum of positive squares in 7 ways, for example, as 29328275025 + 22929227776 = 171255^2 + 151424^2 .
It is not a de Polignac number, because 52257502801 - 25 = 52257502769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52257502831) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 462455721 + ... + 462455833.
Almost surely, 252257502801 is an apocalyptic number.
52257502801 is the 228599-th square number.
52257502801 is the 114300-th centered octagonal number.
It is an amenable number.
52257502801 is a deficient number, since it is larger than the sum of its proper divisors (12907764470).
52257502801 is an frugal number, since it uses more digits than its factorization.
52257502801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 308 (or 137 counting only the distinct ones).
The product of its (nonzero) digits is 56000, while the sum is 37.
The spelling of 52257502801 in words is "fifty-two billion, two hundred fifty-seven million, five hundred two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •