Search a number
-
+
145471305869 is a prime number
BaseRepresentation
bin1000011101111011000…
…0111111100010001101
3111220111010221000102022
42013132300333202031
54340411123241434
6150454550535525
713336625461241
oct2073660774215
9456433830368
10145471305869
115676a83a22a
122423a0675a5
131094426a1a6
147080136421
153bb622422e
hex21dec3f88d

145471305869 has 2 divisors, whose sum is σ = 145471305870. Its totient is φ = 145471305868.

The previous prime is 145471305851. The next prime is 145471305877. The reversal of 145471305869 is 968503174541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 129510015625 + 15961290244 = 359875^2 + 126338^2 .

It is a cyclic number.

It is not a de Polignac number, because 145471305869 - 220 = 145470257293 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2145471305869 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3628800, while the sum is 53.

The spelling of 145471305869 in words is "one hundred forty-five billion, four hundred seventy-one million, three hundred five thousand, eight hundred sixty-nine".