Base | Representation |
---|---|
bin | 1100011011001… |
… | …1010101000000 |
3 | 10122001201000000 |
4 | 3012303111000 |
5 | 101320133002 |
6 | 5101000000 |
7 | 1201653024 |
oct | 306632500 |
9 | 118051000 |
10 | 52114752 |
11 | 27465648 |
12 | 15553000 |
13 | aa48b41 |
14 | 6cc8384 |
15 | 489661c |
hex | 31b3540 |
52114752 has 98 divisors (see below), whose sum is σ = 155190698. Its totient is φ = 17356032.
The previous prime is 52114747. The next prime is 52114789. The reversal of 52114752 is 25741125.
It can be written as a sum of positive squares in only one way, i.e., 31539456 + 20575296 = 5616^2 + 4536^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 13 ways as a sum of consecutive naturals, for example, 46098 + ... + 47214.
Almost surely, 252114752 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 52114752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77595349).
52114752 is an abundant number, since it is smaller than the sum of its proper divisors (103075946).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52114752 is an equidigital number, since it uses as much as digits as its factorization.
52114752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147 (or 1122 counting only the distinct ones).
The product of its digits is 2800, while the sum is 27.
The square root of 52114752 is about 7219.0547857736. The cubic root of 52114752 is about 373.5254736581.
Adding to 52114752 its reverse (25741125), we get a palindrome (77855877).
The spelling of 52114752 in words is "fifty-two million, one hundred fourteen thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •