Base | Representation |
---|---|
bin | 11110000011110… |
… | …01000001111101 |
3 | 122120110202020100 |
4 | 33001321001331 |
5 | 1004022411411 |
6 | 41004311313 |
7 | 6151162542 |
oct | 1701710175 |
9 | 576422210 |
10 | 252153981 |
11 | 11a375022 |
12 | 70542539 |
13 | 40317c51 |
14 | 256babc9 |
15 | 1720c456 |
hex | f07907d |
252153981 has 6 divisors (see below), whose sum is σ = 364222430. Its totient is φ = 168102648.
The previous prime is 252153973. The next prime is 252153989. The reversal of 252153981 is 189351252.
252153981 is a `hidden beast` number, since 2 + 521 + 53 + 9 + 81 = 666.
It is an interprime number because it is at equal distance from previous prime (252153973) and next prime (252153989).
It can be written as a sum of positive squares in only one way, i.e., 236113956 + 16040025 = 15366^2 + 4005^2 .
It is not a de Polignac number, because 252153981 - 23 = 252153973 is a prime.
It is a super-2 number, since 2×2521539812 = 127163260268296722, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252153989) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14008546 + ... + 14008563.
Almost surely, 2252153981 is an apocalyptic number.
It is an amenable number.
252153981 is a deficient number, since it is larger than the sum of its proper divisors (112068449).
252153981 is a wasteful number, since it uses less digits than its factorization.
252153981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28017115 (or 28017112 counting only the distinct ones).
The product of its digits is 21600, while the sum is 36.
The square root of 252153981 is about 15879.3570713678. The cubic root of 252153981 is about 631.7645842811.
The spelling of 252153981 in words is "two hundred fifty-two million, one hundred fifty-three thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •