Search a number
-
+
145653126457 is a prime number
BaseRepresentation
bin1000011110100110011…
…0100101010100111001
3111220221211001110101011
42013221212211110321
54341244200021312
6150525003553521
713344264101356
oct2075146452471
9456854043334
10145653126457
1156853435783
122428ab2b8a1
1310972b2a937
14709a34562d
153bc718bda7
hex21e99a5539

145653126457 has 2 divisors, whose sum is σ = 145653126458. Its totient is φ = 145653126456.

The previous prime is 145653126449. The next prime is 145653126497. The reversal of 145653126457 is 754621356541.

145653126457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 104491209001 + 41161917456 = 323251^2 + 202884^2 .

It is a cyclic number.

It is not a de Polignac number, because 145653126457 - 23 = 145653126449 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2145653126457 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3024000, while the sum is 49.

The spelling of 145653126457 in words is "one hundred forty-five billion, six hundred fifty-three million, one hundred twenty-six thousand, four hundred fifty-seven".