Search a number
-
+
9149399569 is a prime number
BaseRepresentation
bin10001000010101100…
…01100001000010001
3212121122012122200201
420201112030020101
5122214221241234
64111515215201
7442505420212
oct104126141021
925548178621
109149399569
113975663352
121934147501
13b2a6cbacb
1462b1c5409
1538838d314
hex22158c211

9149399569 has 2 divisors, whose sum is σ = 9149399570. Its totient is φ = 9149399568.

The previous prime is 9149399533. The next prime is 9149399591. The reversal of 9149399569 is 9659939419.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5258135169 + 3891264400 = 72513^2 + 62380^2 .

It is a cyclic number.

It is not a de Polignac number, because 9149399569 - 215 = 9149366801 is a prime.

It is a super-2 number, since 2×91493995692 (a number of 21 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 9149399569.

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

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

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

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

Almost surely, 29149399569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 21257640, while the sum is 64.

The square root of 9149399569 is about 95652.4937939414. The cubic root of 9149399569 is about 2091.5304807389.

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