Base | Representation |
---|---|
bin | 1100011101010… |
… | …0100111011110 |
3 | 10122022122001000 |
4 | 3013110213132 |
5 | 101334013402 |
6 | 5103531130 |
7 | 1203061401 |
oct | 307244736 |
9 | 118278030 |
10 | 52251102 |
11 | 27549032 |
12 | 155b9aa6 |
13 | aa95c17 |
14 | 6d21d38 |
15 | 48c1c1c |
hex | 31d49de |
52251102 has 64 divisors (see below), whose sum is σ = 123494400. Its totient is φ = 16329600.
The previous prime is 52251091. The next prime is 52251103. The reversal of 52251102 is 20115225.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52251103) 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, 130102 + ... + 130502.
It is an arithmetic number, because the mean of its divisors is an integer number (1929600).
Almost surely, 252251102 is an apocalyptic number.
52251102 is the 4572-nd heptagonal number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52251102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61747200).
52251102 is an abundant number, since it is smaller than the sum of its proper divisors (71243298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52251102 is a wasteful number, since it uses less digits than its factorization.
52251102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 558 (or 552 counting only the distinct ones).
The product of its (nonzero) digits is 200, while the sum is 18.
The square root of 52251102 is about 7228.4923739325. The cubic root of 52251102 is about 373.8509467337.
Adding to 52251102 its reverse (20115225), we get a palindrome (72366327).
The spelling of 52251102 in words is "fifty-two million, two hundred fifty-one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •