Search a number
-
+
99994143569 is a prime number
BaseRepresentation
bin101110100100000011…
…1011000101101010001
3100120002202121210201212
41131020013120231101
53114242000043234
6113534153305505
710136643124235
oct1351007305521
9316082553655
1099994143569
11394530a6081
1217467a05295
13957753bbb8
144ba83785c5
15290397e5ce
hex17481d8b51

99994143569 has 2 divisors, whose sum is σ = 99994143570. Its totient is φ = 99994143568.

The previous prime is 99994143553. The next prime is 99994143583. The reversal of 99994143569 is 96534149999.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99816187969 + 177955600 = 315937^2 + 13340^2 .

It is a cyclic number.

It is not a de Polignac number, because 99994143569 - 24 = 99994143553 is a prime.

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

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

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

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

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

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

Almost surely, 299994143569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 85030560, while the sum is 68.

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