Search a number
-
+
949019099381 is a prime number
BaseRepresentation
bin11011100111101011111…
…00100100000011110101
310100201120202212100011122
431303311330210003311
5111022042342140011
62003550124513325
7125364402150503
oct15636574440365
93321522770148
10949019099381
113365275a4781
12133b146ab845
136b652248162
1433d0b73b673
1519a45c143db
hexdcf5f240f5

949019099381 has 2 divisors, whose sum is σ = 949019099382. Its totient is φ = 949019099380.

The previous prime is 949019099311. The next prime is 949019099383. The reversal of 949019099381 is 183990910949.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 943365412900 + 5653686481 = 971270^2 + 75191^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-949019099381 is a prime.

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

Together with 949019099383, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2949019099381 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5668704, while the sum is 62.

The spelling of 949019099381 in words is "nine hundred forty-nine billion, nineteen million, ninety-nine thousand, three hundred eighty-one".