Search a number
-
+
101001011011133 is a prime number
BaseRepresentation
bin10110111101110000100001…
…011000100001111000111101
3111020121121021010010122022112
4112331300201120201320331
5101214300032304324013
6554451120210423405
730163040131302512
oct2675604130417075
9436547233118275
10101001011011133
112a200319696762
12b3b280a291b65
13444847ba0580c
141ad2691631309
15ba2404b8eba8
hex5bdc21621e3d

101001011011133 has 2 divisors, whose sum is σ = 101001011011134. Its totient is φ = 101001011011132.

The previous prime is 101001011011097. The next prime is 101001011011139. The reversal of 101001011011133 is 331110110100101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 81505271512729 + 19495739498404 = 9028027^2 + 4415398^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101001011011133 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101001011011133 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101001011011133 its reverse (331110110100101), we get a palindrome (432111121111234).

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