Base | Representation |
---|---|
bin | 1100011011011… |
… | …0001110001010 |
3 | 10122002022020220 |
4 | 3012312032022 |
5 | 101321022402 |
6 | 5101130510 |
7 | 1202032413 |
oct | 306661612 |
9 | 118068226 |
10 | 52126602 |
11 | 27473540 |
12 | 15559a36 |
13 | aa51358 |
14 | 6ccc80a |
15 | 4899dbc |
hex | 31b638a |
52126602 has 48 divisors (see below), whose sum is σ = 118970208. Its totient is φ = 15099040.
The previous prime is 52126589. The next prime is 52126631. The reversal of 52126602 is 20662125.
52126602 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 23 ways as a sum of consecutive naturals, for example, 34168 + ... + 35660.
It is an arithmetic number, because the mean of its divisors is an integer number (2478546).
Almost surely, 252126602 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52126602, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59485104).
52126602 is an abundant number, since it is smaller than the sum of its proper divisors (66843606).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52126602 is a wasteful number, since it uses less digits than its factorization.
52126602 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1555 (or 1532 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 52126602 is about 7219.8754836908. The cubic root of 52126602 is about 373.5537826062.
Adding to 52126602 its reverse (20662125), we get a palindrome (72788727).
The spelling of 52126602 in words is "fifty-two million, one hundred twenty-six thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •