Base | Representation |
---|---|
bin | 1100100001110… |
… | …1000110100001 |
3 | 10122212201022021 |
4 | 3020131012201 |
5 | 101423014001 |
6 | 5114141441 |
7 | 1205436112 |
oct | 310350641 |
9 | 118781267 |
10 | 52548001 |
11 | 27731100 |
12 | 15721881 |
13 | ab6b0bc |
14 | 6d9c209 |
15 | 492eba1 |
hex | 321d1a1 |
52548001 has 9 divisors (see below), whose sum is σ = 57847153. Its totient is φ = 47698420.
The previous prime is 52547981. The next prime is 52548011. The reversal of 52548001 is 10084525.
The square root of 52548001 is 7249.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 52548001 - 217 = 52416929 is a prime.
It is a super-2 number, since 2×525480012 = 5522584818192002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (52548011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 79410 + ... + 80068.
Almost surely, 252548001 is an apocalyptic number.
52548001 is the 7249-th square number.
52548001 is the 3625-th centered octagonal number.
It is an amenable number.
52548001 is a deficient number, since it is larger than the sum of its proper divisors (5299152).
52548001 is an frugal number, since it uses more digits than its factorization.
52548001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1340 (or 670 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 25.
The cubic root of 52548001 is about 374.5577031270.
Multiplying 52548001 by its sum of digits (25), we get a square (1313700025 = 362452).
Multiplying 52548001 by its product of nonzero digits (1600), we get a square (84076801600 = 2899602).
The spelling of 52548001 in words is "fifty-two million, five hundred forty-eight thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •