Search a number
-
+
1101215553133 is a prime number
BaseRepresentation
bin10000000001100101100…
…011111101011001101101
310220021102121100021011011
4100001211203331121231
5121020242140200013
62201520315025221
7142363101521143
oct20014543753155
93807377307134
101101215553133
11395028520063
1215950aa3b211
137cac8886a97
143b428ac5593
151d9a255ec3d
hex100658fd66d

1101215553133 has 2 divisors, whose sum is σ = 1101215553134. Its totient is φ = 1101215553132.

The previous prime is 1101215553131. The next prime is 1101215553169. The reversal of 1101215553133 is 3313555121011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 943223612809 + 157991940324 = 971197^2 + 397482^2 .

It is a cyclic number.

It is not a de Polignac number, because 1101215553133 - 21 = 1101215553131 is a prime.

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

Together with 1101215553131, it forms a pair of twin primes.

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

It is a congruent number.

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

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

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

Almost surely, 21101215553133 is an apocalyptic number.

It is an amenable number.

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

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

1101215553133 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 6750, while the sum is 31.

The spelling of 1101215553133 in words is "one trillion, one hundred one billion, two hundred fifteen million, five hundred fifty-three thousand, one hundred thirty-three".