Base | Representation |
---|---|
bin | 11110000111100… |
… | …10001010000101 |
3 | 122121101221210202 |
4 | 33003302022011 |
5 | 1004134300432 |
6 | 41023100245 |
7 | 6155330156 |
oct | 1703621205 |
9 | 577357722 |
10 | 252650117 |
11 | 11a683855 |
12 | 70741685 |
13 | 4045ca15 |
14 | 257a992d |
15 | 172a9462 |
hex | f0f2285 |
252650117 has 16 divisors (see below), whose sum is σ = 265574400. Its totient is φ = 240045120.
The previous prime is 252650113. The next prime is 252650131. The reversal of 252650117 is 711056252.
It is a cyclic number.
It is not a de Polignac number, because 252650117 - 22 = 252650113 is a prime.
It is a super-2 number, since 2×2526501172 = 127664163240227378, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 252650117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252650113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 666434 + ... + 666812.
It is an arithmetic number, because the mean of its divisors is an integer number (16598400).
Almost surely, 2252650117 is an apocalyptic number.
It is an amenable number.
252650117 is a deficient number, since it is larger than the sum of its proper divisors (12924283).
252650117 is a wasteful number, since it uses less digits than its factorization.
252650117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 716.
The product of its (nonzero) digits is 4200, while the sum is 29.
The square root of 252650117 is about 15894.9714375333. The cubic root of 252650117 is about 632.1786643368.
The spelling of 252650117 in words is "two hundred fifty-two million, six hundred fifty thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •