Base | Representation |
---|---|
bin | 11110011110011… |
… | …01011110101101 |
3 | 122211001010212001 |
4 | 33033031132231 |
5 | 1010421124423 |
6 | 41211212301 |
7 | 6222644326 |
oct | 1717153655 |
9 | 584033761 |
10 | 255645613 |
11 | 12133a373 |
12 | 71747091 |
13 | 40c6b2c2 |
14 | 25d4944d |
15 | 1769bcad |
hex | f3cd7ad |
255645613 has 2 divisors, whose sum is σ = 255645614. Its totient is φ = 255645612.
The previous prime is 255645581. The next prime is 255645631. The reversal of 255645613 is 316546552.
Together with next prime (255645631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145878084 + 109767529 = 12078^2 + 10477^2 .
It is a cyclic number.
It is not a de Polignac number, because 255645613 - 25 = 255645581 is a prime.
It is a super-2 number, since 2×2556456132 = 130709358892291538, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (255645673) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 127822806 + 127822807.
It is an arithmetic number, because the mean of its divisors is an integer number (127822807).
Almost surely, 2255645613 is an apocalyptic number.
It is an amenable number.
255645613 is a deficient number, since it is larger than the sum of its proper divisors (1).
255645613 is an equidigital number, since it uses as much as digits as its factorization.
255645613 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 108000, while the sum is 37.
The square root of 255645613 is about 15988.9215708878. The cubic root of 255645613 is about 634.6672884528.
The spelling of 255645613 in words is "two hundred fifty-five million, six hundred forty-five thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •