Base | Representation |
---|---|
bin | 11110001000101… |
… | …01101000111100 |
3 | 122121200100011112 |
4 | 33010111220330 |
5 | 1004203423302 |
6 | 41030141152 |
7 | 6156503660 |
oct | 1704255074 |
9 | 577610145 |
10 | 252795452 |
11 | 11a772a68 |
12 | 707b17b8 |
13 | 404b0c10 |
14 | 258068a0 |
15 | 172d7552 |
hex | f115a3c |
252795452 has 96 divisors (see below), whose sum is σ = 576221184. Its totient is φ = 94348800.
The previous prime is 252795449. The next prime is 252795493. The reversal of 252795452 is 254597252.
252795452 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 484952 + ... + 485472.
It is an arithmetic number, because the mean of its divisors is an integer number (6002304).
Almost surely, 2252795452 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 252795452, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (288110592).
252795452 is an abundant number, since it is smaller than the sum of its proper divisors (323425732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252795452 is a wasteful number, since it uses less digits than its factorization.
252795452 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 619 (or 617 counting only the distinct ones).
The product of its digits is 252000, while the sum is 41.
The square root of 252795452 is about 15899.5425091416. The cubic root of 252795452 is about 632.2998597085.
It can be divided in two parts, 2527 and 95452, that added together give a palindrome (97979).
The spelling of 252795452 in words is "two hundred fifty-two million, seven hundred ninety-five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •