Search a number
-
+
255255281 is a prime number
BaseRepresentation
bin11110011011011…
…10001011110001
3122210022022102022
433031232023301
51010321132111
641155001225
76216430331
oct1715561361
9583268368
10255255281
111210a3086
1271599215
1340b62738
1425c870c1
15176212db
hexf36e2f1

255255281 has 2 divisors, whose sum is σ = 255255282. Its totient is φ = 255255280.

The previous prime is 255255263. The next prime is 255255283. The reversal of 255255281 is 182552552.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 218773681 + 36481600 = 14791^2 + 6040^2 .

It is a cyclic number.

It is not a de Polignac number, because 255255281 - 210 = 255254257 is a prime.

It is a super-2 number, since 2×2552552812 = 130310516956777922, which contains 22 as substring.

Together with 255255283, it forms a pair of twin primes.

It is a Chen prime.

It is equal to p13950971 and since 255255281 and 13950971 have the same sum of digits, it is a Honaker prime.

It is not a weakly prime, because it can be changed into another prime (255255283) 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 as a sum of consecutive naturals, namely, 127627640 + 127627641.

It is an arithmetic number, because the mean of its divisors is an integer number (127627641).

Almost surely, 2255255281 is an apocalyptic number.

It is an amenable number.

255255281 is a deficient number, since it is larger than the sum of its proper divisors (1).

255255281 is an equidigital number, since it uses as much as digits as its factorization.

255255281 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 40000, while the sum is 35.

The square root of 255255281 is about 15976.7105813431. The cubic root of 255255281 is about 634.3441104165.

The spelling of 255255281 in words is "two hundred fifty-five million, two hundred fifty-five thousand, two hundred eighty-one".