Base | Representation |
---|---|
bin | 1100011100000… |
… | …0100111110000 |
3 | 10122011110200121 |
4 | 3013000213300 |
5 | 101323403300 |
6 | 5102100024 |
7 | 1202300536 |
oct | 307004760 |
9 | 118143617 |
10 | 52169200 |
11 | 274a2546 |
12 | 1557a614 |
13 | aa67865 |
14 | 6d00156 |
15 | 48a781a |
hex | 31c09f0 |
52169200 has 30 divisors (see below), whose sum is σ = 125337464. Its totient is φ = 20867520.
The previous prime is 52169153. The next prime is 52169203. The reversal of 52169200 is 296125.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52169203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 64812 + ... + 65611.
Almost surely, 252169200 is an apocalyptic number.
52169200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
52169200 is an abundant number, since it is smaller than the sum of its proper divisors (73168264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52169200 is a wasteful number, since it uses less digits than its factorization.
52169200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130441 (or 130430 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 52169200 is about 7222.8249321162. The cubic root of 52169200 is about 373.6555112871.
The spelling of 52169200 in words is "fifty-two million, one hundred sixty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •