Base | Representation |
---|---|
bin | 1100100000000… |
… | …1010011100110 |
3 | 10122122221010120 |
4 | 3020001103212 |
5 | 101410343100 |
6 | 5111502410 |
7 | 1204453146 |
oct | 310012346 |
9 | 118587116 |
10 | 52434150 |
11 | 2766360a |
12 | 15687a06 |
13 | ab2b332 |
14 | 6d6c926 |
15 | 490b0a0 |
hex | 32014e6 |
52434150 has 48 divisors (see below), whose sum is σ = 131362128. Its totient is φ = 13840000.
The previous prime is 52434149. The next prime is 52434163. The reversal of 52434150 is 5143425.
It is a self number, because there is not a number n which added to its sum of digits gives 52434150.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13420 + ... + 16880.
It is an arithmetic number, because the mean of its divisors is an integer number (2736711).
Almost surely, 252434150 is an apocalyptic number.
52434150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 52434150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (65681064).
52434150 is an abundant number, since it is smaller than the sum of its proper divisors (78927978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52434150 is a wasteful number, since it uses less digits than its factorization.
52434150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3577 (or 3572 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 24.
The square root of 52434150 is about 7241.1428655979. The cubic root of 52434150 is about 374.2870007670.
Adding to 52434150 its reverse (5143425), we get a palindrome (57577575).
The spelling of 52434150 in words is "fifty-two million, four hundred thirty-four thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •