Search a number
-
+
1011213030133 is a prime number
BaseRepresentation
bin11101011011100001111…
…11100101001011110101
310120200010011201101010101
432231300333211023311
5113031431013431013
62052313404354101
7133025541635665
oct16556077451365
93520104641111
101011213030133
1135a942436449
12143b91245931
1374484390307
1436d2b72c1a5
151b485d858dd
hexeb70fe52f5

1011213030133 has 2 divisors, whose sum is σ = 1011213030134. Its totient is φ = 1011213030132.

The previous prime is 1011213030029. The next prime is 1011213030203. The reversal of 1011213030133 is 3310303121101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 989931472209 + 21281557924 = 994953^2 + 145882^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1011213030133 - 213 = 1011213021941 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1011213030133.

It is a congruent number.

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

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

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

Almost surely, 21011213030133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 162, while the sum is 19.

Adding to 1011213030133 its reverse (3310303121101), we get a palindrome (4321516151234).

The spelling of 1011213030133 in words is "one trillion, eleven billion, two hundred thirteen million, thirty thousand, one hundred thirty-three".