Search a number
-
+
109947949057 is a prime number
BaseRepresentation
bin110011001100101101…
…0001001000000000001
3101111210110110111220101
41212121122021000001
53300133133332212
6122302010042401
710641420101302
oct1463132110001
9344713414811
10109947949057
11426a0829501
1219385419401
13a4a27a412b
1454703147a9
152cd7765157
hex1999689001

109947949057 has 2 divisors, whose sum is σ = 109947949058. Its totient is φ = 109947949056.

The previous prime is 109947949043. The next prime is 109947949087. The reversal of 109947949057 is 750949749901.

It is a Cunningham number, because it is equal to 3315842+1.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 109947949056 + 1 = 331584^2 + 1^2 .

It is a cyclic number.

It is not a de Polignac number, because 109947949057 - 215 = 109947916289 is a prime.

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

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

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

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

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

Almost surely, 2109947949057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25719120, while the sum is 64.

The spelling of 109947949057 in words is "one hundred nine billion, nine hundred forty-seven million, nine hundred forty-nine thousand, fifty-seven".