Search a number
-
+
145020569 is a prime number
BaseRepresentation
bin10001010010011…
…01011010011001
3101002212210211012
420221031122121
5244111124234
622220143305
73410440331
oct1051153231
9332783735
10145020569
1174951111
1240697b35
13240775b5
14153900c1
15cae90ce
hex8a4d699

145020569 has 2 divisors, whose sum is σ = 145020570. Its totient is φ = 145020568.

The previous prime is 145020541. The next prime is 145020571. The reversal of 145020569 is 965020541.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 127690000 + 17330569 = 11300^2 + 4163^2 .

It is a cyclic number.

It is not a de Polignac number, because 145020569 - 216 = 144955033 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (145020599) 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, 72510284 + 72510285.

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

Almost surely, 2145020569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10800, while the sum is 32.

The square root of 145020569 is about 12042.4486297430. The cubic root of 145020569 is about 525.3836276952.

The spelling of 145020569 in words is "one hundred forty-five million, twenty thousand, five hundred sixty-nine".