Base | Representation |
---|---|
bin | 1100100011101… |
… | …0000001011100 |
3 | 10200002201210122 |
4 | 3020322001130 |
5 | 101440311320 |
6 | 5120454112 |
7 | 1206441350 |
oct | 310720134 |
9 | 120081718 |
10 | 52666460 |
11 | 27802100 |
12 | 1577a338 |
13 | abaccb2 |
14 | 6dcd460 |
15 | 4954d25 |
hex | 323a05c |
52666460 has 72 divisors (see below), whose sum is σ = 138979680. Its totient is φ = 16410240.
The previous prime is 52666433. The next prime is 52666463. The reversal of 52666460 is 6466625.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 52666460.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52666463) 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 23 ways as a sum of consecutive naturals, for example, 15386 + ... + 18494.
Almost surely, 252666460 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 52666460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69489840).
52666460 is an abundant number, since it is smaller than the sum of its proper divisors (86313220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52666460 is a wasteful number, since it uses less digits than its factorization.
52666460 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3147 (or 3134 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 35.
The square root of 52666460 is about 7257.1661135735. The cubic root of 52666460 is about 374.8389471381.
The spelling of 52666460 in words is "fifty-two million, six hundred sixty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •