Base | Representation |
---|---|
bin | 1100100000100… |
… | …1000111010010 |
3 | 10122201120000000 |
4 | 3020021013102 |
5 | 101412404010 |
6 | 5112310430 |
7 | 1204645323 |
oct | 310110722 |
9 | 118646000 |
10 | 52466130 |
11 | 27685642 |
12 | 156a2416 |
13 | ab3ca62 |
14 | 6d7a44a |
15 | 49157c0 |
hex | 32091d2 |
52466130 has 64 divisors (see below), whose sum is σ = 141696000. Its totient is φ = 13985136.
The previous prime is 52466129. The next prime is 52466137. The reversal of 52466130 is 3166425.
52466130 is a `hidden beast` number, since 5 + 2 + 46 + 613 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 52466094 and 52466103.
It is not an unprimeable number, because it can be changed into a prime (52466137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20671 + ... + 23069.
It is an arithmetic number, because the mean of its divisors is an integer number (2214000).
Almost surely, 252466130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52466130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70848000).
52466130 is an abundant number, since it is smaller than the sum of its proper divisors (89229870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52466130 is an equidigital number, since it uses as much as digits as its factorization.
52466130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2427 (or 2409 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 52466130 is about 7243.3507439582. The cubic root of 52466130 is about 374.3630788296.
The spelling of 52466130 in words is "fifty-two million, four hundred sixty-six thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •