Base | Representation |
---|---|
bin | 11110011011100… |
… | …00001000000111 |
3 | 122210022201100001 |
4 | 33031300020013 |
5 | 1010321410424 |
6 | 41155102131 |
7 | 6216462460 |
oct | 1715601007 |
9 | 583281301 |
10 | 255263239 |
11 | 1210a9060 |
12 | 715a1947 |
13 | 40b6624a |
14 | 25c89d67 |
15 | 17623844 |
hex | f370207 |
255263239 has 8 divisors (see below), whose sum is σ = 318250368. Its totient is φ = 198906360.
The previous prime is 255263237. The next prime is 255263243. The reversal of 255263239 is 932362552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 255263239 - 21 = 255263237 is a prime.
It is a super-2 number, since 2×2552632392 = 130318642369542242, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 255263198 and 255263207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255263237) 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 7 ways as a sum of consecutive naturals, for example, 1657477 + ... + 1657630.
It is an arithmetic number, because the mean of its divisors is an integer number (39781296).
Almost surely, 2255263239 is an apocalyptic number.
255263239 is a deficient number, since it is larger than the sum of its proper divisors (62987129).
255263239 is a wasteful number, since it uses less digits than its factorization.
255263239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3315125.
The product of its digits is 97200, while the sum is 37.
The square root of 255263239 is about 15976.9596294164. The cubic root of 255263239 is about 634.3507025856.
The spelling of 255263239 in words is "two hundred fifty-five million, two hundred sixty-three thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •