Search a number
-
+
115143103469 is a prime number
BaseRepresentation
bin110101100111100010…
…0000101001111101101
3102000012112001200222202
41223033010011033231
53341303113302334
6124521312151245
711214232142132
oct1531704051755
9360175050882
10115143103469
1144917309949
121a395238525
13ab1cbb15b4
145804296589
152edd8ba17e
hex1acf1053ed

115143103469 has 2 divisors, whose sum is σ = 115143103470. Its totient is φ = 115143103468.

The previous prime is 115143103417. The next prime is 115143103477. The reversal of 115143103469 is 964301341511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 96201086569 + 18942016900 = 310163^2 + 137630^2 .

It is a cyclic number.

It is not a de Polignac number, because 115143103469 - 232 = 110848136173 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2115143103469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 38.

The spelling of 115143103469 in words is "one hundred fifteen billion, one hundred forty-three million, one hundred three thousand, four hundred sixty-nine".