Search a number
-
+
101000011111033 is a prime number
BaseRepresentation
bin10110111101101111100101…
…110010001101101001111001
3111020121111200102122110020111
4112331233211302031221321
5101214241010321023113
6554450433051224321
730163003300266046
oct2675574562155171
9436544612573214
10101000011111033
112a1aa956230a41
12b3b258b4480a1
13444834c801c58
141ad25d890c1cd
15ba2396ecd13d
hex5bdbe5c8da79

101000011111033 has 2 divisors, whose sum is σ = 101000011111034. Its totient is φ = 101000011111032.

The previous prime is 101000011110997. The next prime is 101000011111037. The reversal of 101000011111033 is 330111110000101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 80726487283264 + 20273523827769 = 8984792^2 + 4502613^2 .

It is a cyclic number.

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

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2101000011111033 is an apocalyptic number.

It is an amenable number.

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

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

101000011111033 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 101000011111033 its reverse (330111110000101), we get a palindrome (431111121111134).

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