Base | Representation |
---|---|
bin | 1100100001011… |
… | …0111111111000 |
3 | 10122211110000022 |
4 | 3020112333320 |
5 | 101421214000 |
6 | 5113430012 |
7 | 1205303165 |
oct | 310267770 |
9 | 118743008 |
10 | 52523000 |
11 | 27714342 |
12 | 1570b308 |
13 | ab5c8ca |
14 | 6d9306c |
15 | 4927585 |
hex | 3216ff8 |
52523000 has 64 divisors (see below), whose sum is σ = 125349120. Its totient is φ = 20592000.
The previous prime is 52522993. The next prime is 52523027. The reversal of 52523000 is 32525.
It is a self number, because there is not a number n which added to its sum of digits gives 52523000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52505 + ... + 53495.
It is an arithmetic number, because the mean of its divisors is an integer number (1958580).
Almost surely, 252523000 is an apocalyptic number.
52523000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52523000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62674560).
52523000 is an abundant number, since it is smaller than the sum of its proper divisors (72826120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52523000 is a wasteful number, since it uses less digits than its factorization.
52523000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1065 (or 1051 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 17.
The square root of 52523000 is about 7247.2753500885. The cubic root of 52523000 is about 374.4982920333.
Adding to 52523000 its reverse (32525), we get a palindrome (52555525).
The spelling of 52523000 in words is "fifty-two million, five hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •