Base | Representation |
---|---|
bin | 1100100010000… |
… | …0001010101000 |
3 | 10122220100112010 |
4 | 3020200022220 |
5 | 101423414202 |
6 | 5114315520 |
7 | 1205520522 |
oct | 310401250 |
9 | 118810463 |
10 | 52560552 |
11 | 2773a580 |
12 | 15728ba0 |
13 | ab73a25 |
14 | 6da2a12 |
15 | 493376c |
hex | 32202a8 |
52560552 has 64 divisors (see below), whose sum is σ = 145022400. Its totient is φ = 15741440.
The previous prime is 52560551. The next prime is 52560553. The reversal of 52560552 is 25506525.
It is an interprime number because it is at equal distance from previous prime (52560551) and next prime (52560553).
It is a super-2 number, since 2×525605522 = 5525223253089408, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (52560551) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22378 + ... + 24614.
It is an arithmetic number, because the mean of its divisors is an integer number (2265975).
Almost surely, 252560552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52560552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72511200).
52560552 is an abundant number, since it is smaller than the sum of its proper divisors (92461848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52560552 is a wasteful number, since it uses less digits than its factorization.
52560552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2346 (or 2342 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 30.
The square root of 52560552 is about 7249.8656539277. The cubic root of 52560552 is about 374.5875215749.
The spelling of 52560552 in words is "fifty-two million, five hundred sixty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •