Base | Representation |
---|---|
bin | 11110011101101… |
… | …01011001101101 |
3 | 122210212010120022 |
4 | 33032311121231 |
5 | 1010410000424 |
6 | 41205131525 |
7 | 6222053645 |
oct | 1716653155 |
9 | 583763508 |
10 | 255546989 |
11 | 121282265 |
12 | 716b9ba5 |
13 | 40c35449 |
14 | 25d21525 |
15 | 1767c95e |
hex | f3b566d |
255546989 has 2 divisors, whose sum is σ = 255546990. Its totient is φ = 255546988.
The previous prime is 255546971. The next prime is 255547007. The reversal of 255546989 is 989645552.
It is a balanced prime because it is at equal distance from previous prime (255546971) and next prime (255547007).
It can be written as a sum of positive squares in only one way, i.e., 184009225 + 71537764 = 13565^2 + 8458^2 .
It is a cyclic number.
It is not a de Polignac number, because 255546989 - 216 = 255481453 is a prime.
It is a super-2 number, since 2×2555469892 = 130608527173932242, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 255546989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255546959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127773494 + 127773495.
It is an arithmetic number, because the mean of its divisors is an integer number (127773495).
Almost surely, 2255546989 is an apocalyptic number.
It is an amenable number.
255546989 is a deficient number, since it is larger than the sum of its proper divisors (1).
255546989 is an equidigital number, since it uses as much as digits as its factorization.
255546989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3888000, while the sum is 53.
The square root of 255546989 is about 15985.8371379168. The cubic root of 255546989 is about 634.5856631163.
The spelling of 255546989 in words is "two hundred fifty-five million, five hundred forty-six thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •