Search a number
-
+
101011000011133 is a prime number
BaseRepresentation
bin10110111101111001110100…
…110001100010100101111101
3111020122120001021012102021111
4112331321310301202211331
5101214431012000324013
6554455451321402021
730163542513351502
oct2675716461424575
9436576037172244
10101011000011133
112a204585178263
12b3b4737639311
1344493b13411c4
141ad2d5c12d4a9
15ba27dbac873d
hex5bde74c6297d

101011000011133 has 2 divisors, whose sum is σ = 101011000011134. Its totient is φ = 101011000011132.

The previous prime is 101011000011029. The next prime is 101011000011143. The reversal of 101011000011133 is 331110000110101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 70865047387044 + 30145952624089 = 8418138^2 + 5490533^2 .

It is a cyclic number.

It is not a de Polignac number, because 101011000011133 - 217 = 101010999880061 is a prime.

It is a super-2 number, since 2×1010110000111332 (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 (101011000011143) by changing a digit.

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

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

Almost surely, 2101011000011133 is an apocalyptic number.

It is an amenable number.

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

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

101011000011133 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 13.

Adding to 101011000011133 its reverse (331110000110101), we get a palindrome (432121000121234).

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