Search a number
-
+
110002121921 is a prime number
BaseRepresentation
bin110011001110010100…
…0110010110011000001
3101111221020101210002202
41212130220302303001
53300241020400141
6122311223122545
710642645415546
oct1463450626301
9344836353082
10110002121921
114271936a36a
121939b5a3455
13a4b0a90993
1454775b6bcd
152cdc3b649b
hex199ca32cc1

110002121921 has 2 divisors, whose sum is σ = 110002121922. Its totient is φ = 110002121920.

The previous prime is 110002121909. The next prime is 110002122023. The reversal of 110002121921 is 129121200011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 110001008896 + 1113025 = 331664^2 + 1055^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 110002121921 - 210 = 110002120897 is a prime.

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

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

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

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

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

Almost surely, 2110002121921 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 20.

Adding to 110002121921 its reverse (129121200011), we get a palindrome (239123321932).

The spelling of 110002121921 in words is "one hundred ten billion, two million, one hundred twenty-one thousand, nine hundred twenty-one".