Search a number
-
+
109952268757 is a prime number
BaseRepresentation
bin110011001100110101…
…0100111100111010101
3101111210202120222102021
41212121222213213111
53300140240100012
6122302242413141
710641501602212
oct1463152474725
9344722528367
10109952268757
11426a3209a01
12193869611b1
13a4a3657376
145470b1ab09
152cd7d1a007
hex1999aa79d5

109952268757 has 2 divisors, whose sum is σ = 109952268758. Its totient is φ = 109952268756.

The previous prime is 109952268739. The next prime is 109952268791. The reversal of 109952268757 is 757862259901.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 107750688516 + 2201580241 = 328254^2 + 46921^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 109952268757 - 215 = 109952235989 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 109952268695 and 109952268704.

It is a congruent number.

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

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

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

Almost surely, 2109952268757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 19051200, while the sum is 61.

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