Search a number
-
+
1011101010133 is a prime number
BaseRepresentation
bin11101011011010100101…
…00010000100011010101
310120122211100221011120111
432231222110100203111
5113031213324311013
62052254323403021
7133023011532034
oct16555224204325
93518740834514
101011101010133
1135a895185135
12143b5b823471
13744670cb6a6
1436d1a8cc71b
151b47b10973d
hexeb6a5108d5

1011101010133 has 2 divisors, whose sum is σ = 1011101010134. Its totient is φ = 1011101010132.

The previous prime is 1011101010107. The next prime is 1011101010149. The reversal of 1011101010133 is 3310101011101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 639516891204 + 371584118929 = 799698^2 + 609577^2 .

It is a cyclic number.

It is not a de Polignac number, because 1011101010133 - 225 = 1011067455701 is a prime.

It is a congruent number.

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

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

Almost surely, 21011101010133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9, while the sum is 13.

Adding to 1011101010133 its reverse (3310101011101), we get a palindrome (4321202021234).

The spelling of 1011101010133 in words is "one trillion, eleven billion, one hundred one million, ten thousand, one hundred thirty-three".