Base | Representation |
---|---|
bin | 1100100101110… |
… | …1100011100100 |
3 | 10200101010110011 |
4 | 3021131203210 |
5 | 102004441004 |
6 | 5123540004 |
7 | 1210615600 |
oct | 311354344 |
9 | 120333404 |
10 | 52812004 |
11 | 278a1493 |
12 | 1582a604 |
13 | ac3130b |
14 | 702a500 |
15 | 4983004 |
hex | 325d8e4 |
52812004 has 36 divisors (see below), whose sum is σ = 108074736. Its totient is φ = 22515024.
The previous prime is 52811971. The next prime is 52812029. The reversal of 52812004 is 40021825.
52812004 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43899 + ... + 45085.
It is an arithmetic number, because the mean of its divisors is an integer number (3002076).
Almost surely, 252812004 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 52812004, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54037368).
52812004 is an abundant number, since it is smaller than the sum of its proper divisors (55262732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52812004 is a wasteful number, since it uses less digits than its factorization.
52812004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1432 (or 1423 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 22.
The square root of 52812004 is about 7267.1868009567. The cubic root of 52812004 is about 375.1839192633.
Adding to 52812004 its reverse (40021825), we get a palindrome (92833829).
The spelling of 52812004 in words is "fifty-two million, eight hundred twelve thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •