Search a number
-
+
145997344069 is a prime number
BaseRepresentation
bin1000011111111000011…
…1101010110101000101
3111221211210202112011121
42013332013222311011
54343000310002234
6151023101433541
713355643643303
oct2077607526505
9457753675147
10145997344069
1156a0a770545
122436626b8b1
13109c923abb5
1470cdd49273
153be74d24b4
hex21fe1ead45

145997344069 has 2 divisors, whose sum is σ = 145997344070. Its totient is φ = 145997344068.

The previous prime is 145997344049. The next prime is 145997344109. The reversal of 145997344069 is 960443799541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 77596787844 + 68400556225 = 278562^2 + 261535^2 .

It is a cyclic number.

It is not a de Polignac number, because 145997344069 - 227 = 145863126341 is a prime.

It is a super-2 number, since 2×1459973440692 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 145997343998 and 145997344016.

It is a congruent number.

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

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

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

Almost surely, 2145997344069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29393280, while the sum is 61.

The spelling of 145997344069 in words is "one hundred forty-five billion, nine hundred ninety-seven million, three hundred forty-four thousand, sixty-nine".