Base | Representation |
---|---|
bin | 1100001101010… |
… | …1110110000000 |
3 | 10120100121120000 |
4 | 3003111312000 |
5 | 101102120202 |
6 | 5025320000 |
7 | 1161154104 |
oct | 303256600 |
9 | 116317500 |
10 | 51207552 |
11 | 269a5aa0 |
12 | 15196000 |
13 | a7bbc36 |
14 | 6b2d904 |
15 | 476791c |
hex | 30d5d80 |
51207552 has 160 divisors (see below), whose sum is σ = 166617000. Its totient is φ = 15482880.
The previous prime is 51207551. The next prime is 51207601. The reversal of 51207552 is 25570215.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51207551) 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 19 ways as a sum of consecutive naturals, for example, 113824 + ... + 114272.
Almost surely, 251207552 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 51207552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (83308500).
51207552 is an abundant number, since it is smaller than the sum of its proper divisors (115409448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51207552 is a wasteful number, since it uses less digits than its factorization.
51207552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 465 counting only the distinct ones).
The product of its (nonzero) digits is 3500, while the sum is 27.
The square root of 51207552 is about 7155.9452205841. The cubic root of 51207552 is about 371.3453627075.
Adding to 51207552 its reverse (25570215), we get a palindrome (76777767).
The spelling of 51207552 in words is "fifty-one million, two hundred seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •