Search a number
-
+
119952536009 is a prime number
BaseRepresentation
bin110111110110110111…
…0100111000111001001
3102110121200212012010212
41233231232213013021
53431130322123014
6131034435050505
711444351506265
oct1575556470711
9373550765125
10119952536009
1146965096789
121b2b7a40a35
13b408409377
145b3cd0d0a5
1531c0c2c23e
hex1bedba71c9

119952536009 has 2 divisors, whose sum is σ = 119952536010. Its totient is φ = 119952536008.

The previous prime is 119952535981. The next prime is 119952536113. The reversal of 119952536009 is 900635259911.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 119857902025 + 94633984 = 346205^2 + 9728^2 .

It is an emirp because it is prime and its reverse (900635259911) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 119952536009 - 28 = 119952535753 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (119952536309) 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, 59976268004 + 59976268005.

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

Almost surely, 2119952536009 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 656100, while the sum is 50.

The spelling of 119952536009 in words is "one hundred nineteen billion, nine hundred fifty-two million, five hundred thirty-six thousand, nine".