Search a number
-
+
144655013 is a prime number
BaseRepresentation
bin10001001111101…
…00001010100101
3101002012020101002
420213310022211
5244012430023
622204243045
73404355506
oct1047641245
9332166332
10144655013
11747214a8
1240540485
1323c7a0a9
14152d6bad
15ca75b28
hex89f42a5

144655013 has 2 divisors, whose sum is σ = 144655014. Its totient is φ = 144655012.

The previous prime is 144655009. The next prime is 144655031. The reversal of 144655013 is 310556441.

It is a happy number.

Together with next prime (144655031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 116596804 + 28058209 = 10798^2 + 5297^2 .

It is a cyclic number.

It is not a de Polignac number, because 144655013 - 22 = 144655009 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

Almost surely, 2144655013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7200, while the sum is 29.

The square root of 144655013 is about 12027.2612426936. The cubic root of 144655013 is about 524.9418082138.

The spelling of 144655013 in words is "one hundred forty-four million, six hundred fifty-five thousand, thirteen".