Search a number
-
+
109042367153 is a prime number
BaseRepresentation
bin110010110001101101…
…1100111101010110001
3101102110100110012001212
41211203123213222301
53241304321222103
6122032100205505
710610112553646
oct1454333475261
9342410405055
10109042367153
1142276634405
1219172099895
13a389ca4b55
1453c5d43dcd
152c82ed47d8
hex19636e7ab1

109042367153 has 2 divisors, whose sum is σ = 109042367154. Its totient is φ = 109042367152.

The previous prime is 109042367123. The next prime is 109042367167. The reversal of 109042367153 is 351763240901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 84441385744 + 24600981409 = 290588^2 + 156847^2 .

It is a cyclic number.

It is not a de Polignac number, because 109042367153 - 220 = 109041318577 is a prime.

It is a super-3 number, since 3×1090423671533 (a number of 34 digits) contains 333 as substring.

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

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

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

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

Almost surely, 2109042367153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 136080, while the sum is 41.

The spelling of 109042367153 in words is "one hundred nine billion, forty-two million, three hundred sixty-seven thousand, one hundred fifty-three".