Base | Representation |
---|---|
bin | 11110000111011… |
… | …00000000110000 |
3 | 122121100200021102 |
4 | 33003230000300 |
5 | 1004132444234 |
6 | 41022343532 |
7 | 6155163605 |
oct | 1703540060 |
9 | 577320242 |
10 | 252624944 |
11 | 11a666950 |
12 | 7072aba8 |
13 | 40451420 |
14 | 257a06ac |
15 | 172a1c7e |
hex | f0ec030 |
252624944 has 80 divisors (see below), whose sum is σ = 589274784. Its totient is φ = 103372800.
The previous prime is 252624929. The next prime is 252625001. The reversal of 252624944 is 449426252.
252624944 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 252624898 and 252624907.
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 15 ways as a sum of consecutive naturals, for example, 92462 + ... + 95154.
Almost surely, 2252624944 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 252624944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (294637392).
252624944 is an abundant number, since it is smaller than the sum of its proper divisors (336649840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252624944 is a wasteful number, since it uses less digits than its factorization.
252624944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2766 (or 2760 counting only the distinct ones).
The product of its digits is 138240, while the sum is 38.
The square root of 252624944 is about 15894.1795636013. The cubic root of 252624944 is about 632.1576677609.
The spelling of 252624944 in words is "two hundred fifty-two million, six hundred twenty-four thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •