Base | Representation |
---|---|
bin | 11110011110000… |
… | …11110101101001 |
3 | 122210222010200101 |
4 | 33033003311221 |
5 | 1010413343441 |
6 | 41210305401 |
7 | 6222421231 |
oct | 1717036551 |
9 | 583863611 |
10 | 255606121 |
11 | 121312731 |
12 | 71728261 |
13 | 40c56334 |
14 | 25d38cc1 |
15 | 17690231 |
hex | f3c3d69 |
255606121 has 8 divisors (see below), whose sum is σ = 261761544. Its totient is φ = 249500160.
The previous prime is 255606119. The next prime is 255606137. The reversal of 255606121 is 121606552.
It can be written as a sum of positive squares in 4 ways, for example, as 55666521 + 199939600 = 7461^2 + 14140^2 .
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 255606121 - 21 = 255606119 is a prime.
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 255606121.
It is not an unprimeable number, because it can be changed into a prime (255606181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1800 + ... + 22681.
It is an arithmetic number, because the mean of its divisors is an integer number (32720193).
Almost surely, 2255606121 is an apocalyptic number.
It is an amenable number.
255606121 is a deficient number, since it is larger than the sum of its proper divisors (6155423).
255606121 is a wasteful number, since it uses less digits than its factorization.
255606121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24731.
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 255606121 is about 15987.6865430868. The cubic root of 255606121 is about 634.6346057467.
The spelling of 255606121 in words is "two hundred fifty-five million, six hundred six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •