[go: up one dir, main page]

Search a number
-
+
145623791 is a prime number
BaseRepresentation
bin10001010111000…
…00101011101111
3101011000110021202
420223200223233
5244234430131
622241120115
73415532105
oct1053405357
9334013252
10145623791
1175223345
124092903b
1324229031
14154a9c75
15cbb7bcb
hex8ae0aef

145623791 has 2 divisors, whose sum is σ = 145623792. Its totient is φ = 145623790.

The previous prime is 145623773. The next prime is 145623799. The reversal of 145623791 is 197326541.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 145623791 - 210 = 145622767 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2145623791 is an apocalyptic number.

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

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

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

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

The square root of 145623791 is about 12067.4682928939. The cubic root of 145623791 is about 526.1110752044. Note that the first 3 decimals are identical.

The spelling of 145623791 in words is "one hundred forty-five million, six hundred twenty-three thousand, seven hundred ninety-one".