Search a number
-
+
110002311469 is a prime number
BaseRepresentation
bin110011001110010100…
…1100001000100101101
3101111221020202102010001
41212130221201010231
53300241042431334
6122311231144301
710642650135301
oct1463451410455
9344836672101
10110002311469
1142719489816
121939b675091
13a4b0b2903b
145477625d01
152cdc402714
hex199ca6112d

110002311469 has 2 divisors, whose sum is σ = 110002311470. Its totient is φ = 110002311468.

The previous prime is 110002311409. The next prime is 110002311473. The reversal of 110002311469 is 964113200011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67137992100 + 42864319369 = 259110^2 + 207037^2 .

It is a cyclic number.

It is not a de Polignac number, because 110002311469 - 213 = 110002303277 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2110002311469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 28.

The spelling of 110002311469 in words is "one hundred ten billion, two million, three hundred eleven thousand, four hundred sixty-nine".