Search a number
-
+
10111000109489 is a prime number
BaseRepresentation
bin1001001100100010011010…
…0100011110000110110001
31022210121020222112001111122
42103020212210132012301
52311124312012000424
633300532422352025
72062332002612666
oct223104644360661
938717228461448
1010111000109489
113249061a721a4
1211736b558b615
13584603900396
1426d53708ba6d
15128024c3e45e
hex9322691e1b1

10111000109489 has 2 divisors, whose sum is σ = 10111000109490. Its totient is φ = 10111000109488.

The previous prime is 10111000109477. The next prime is 10111000109527. The reversal of 10111000109489 is 98490100011101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7959688549264 + 2151311560225 = 2821292^2 + 1466735^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111000109489 - 224 = 10110983332273 is a prime.

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

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

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

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

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

Almost surely, 210111000109489 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 35.

The spelling of 10111000109489 in words is "ten trillion, one hundred eleven billion, one hundred nine thousand, four hundred eighty-nine".