Base | Representation |
---|---|
bin | 11110000011000… |
… | …00001010101001 |
3 | 122120021120112100 |
4 | 33001200022221 |
5 | 1004011132022 |
6 | 41002204013 |
7 | 6150256611 |
oct | 1701401251 |
9 | 576246470 |
10 | 252052137 |
11 | 11a305557 |
12 | 704b3609 |
13 | 402b079c |
14 | 25691a41 |
15 | 171dc1ac |
hex | f0602a9 |
252052137 has 24 divisors (see below), whose sum is σ = 381817800. Its totient is φ = 160005888.
The previous prime is 252052109. The next prime is 252052169. The reversal of 252052137 is 731250252.
252052137 is a `hidden beast` number, since 2 + 520 + 5 + 2 + 137 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 133263936 + 118788201 = 11544^2 + 10899^2 .
It is not a de Polignac number, because 252052137 - 210 = 252051113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 252052137.
It is not an unprimeable number, because it can be changed into a prime (252050137) 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 23 ways as a sum of consecutive naturals, for example, 12439 + ... + 25667.
It is an arithmetic number, because the mean of its divisors is an integer number (15909075).
Almost surely, 2252052137 is an apocalyptic number.
It is an amenable number.
252052137 is a deficient number, since it is larger than the sum of its proper divisors (129765663).
252052137 is a wasteful number, since it uses less digits than its factorization.
252052137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13337 (or 13334 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 252052137 is about 15876.1499426026. The cubic root of 252052137 is about 631.6795170847.
The spelling of 252052137 in words is "two hundred fifty-two million, fifty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •