Search a number
-
+
145433567 is a prime number
BaseRepresentation
bin10001010101100…
…10001111011111
3101010122210100102
420222302033133
5244212333232
622233051315
73414110366
oct1052621737
9333583312
10145433567
1175103434
1240856b3b
1324190586
141545a7dd
15cb7b662
hex8ab23df

145433567 has 2 divisors, whose sum is σ = 145433568. Its totient is φ = 145433566.

The previous prime is 145433551. The next prime is 145433609. The reversal of 145433567 is 765334541.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 145433567 - 24 = 145433551 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 145433567.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (145433527) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72716783 + 72716784.

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

Almost surely, 2145433567 is an apocalyptic number.

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

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

145433567 is an evil number, because the sum of its binary digits is even.

The product of its digits is 151200, while the sum is 38.

The square root of 145433567 is about 12059.5840309689. The cubic root of 145433567 is about 525.8818943339.

The spelling of 145433567 in words is "one hundred forty-five million, four hundred thirty-three thousand, five hundred sixty-seven".