Base | Representation |
---|---|
bin | 1100100100001… |
… | …1111101010000 |
3 | 10200011210121202 |
4 | 3021003331100 |
5 | 101443112102 |
6 | 5121410332 |
7 | 1210001111 |
oct | 311037520 |
9 | 120153552 |
10 | 52707152 |
11 | 2782a733 |
12 | 157999a8 |
13 | abc5684 |
14 | 7000208 |
15 | 4961e02 |
hex | 3243f50 |
52707152 has 30 divisors (see below), whose sum is σ = 105789918. Its totient is φ = 25438336.
The previous prime is 52707139. The next prime is 52707169. The reversal of 52707152 is 25170725.
It can be written as a sum of positive squares in 3 ways, for example, as 16032016 + 36675136 = 4004^2 + 6056^2 .
It is a super-2 number, since 2×527071522 = 5556087743902208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11498 + ... + 15414.
Almost surely, 252707152 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 52707152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52894959).
52707152 is an abundant number, since it is smaller than the sum of its proper divisors (53082766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52707152 is a wasteful number, since it uses less digits than its factorization.
52707152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3983 (or 3948 counting only the distinct ones).
The product of its (nonzero) digits is 4900, while the sum is 29.
The square root of 52707152 is about 7259.9691459399. The cubic root of 52707152 is about 374.9354603004.
Adding to 52707152 its reverse (25170725), we get a palindrome (77877877).
The spelling of 52707152 in words is "fifty-two million, seven hundred seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •