Search a number
-
+
101120111014033 is a prime number
BaseRepresentation
bin10110111111011111011100…
…010010111111000010010001
3111021000222200101210122220001
4112333133130102333002101
5101223222441404422113
6555021534313050001
730204454421520616
oct2677373422770221
9437028611718801
10101120111014033
112a246886520721
12b4119086b6901
13445677c5c7907
141ad834d21c50d
15ba5575b197dd
hex5bf7dc4bf091

101120111014033 has 2 divisors, whose sum is σ = 101120111014034. Its totient is φ = 101120111014032.

The previous prime is 101120111013973. The next prime is 101120111014051. The reversal of 101120111014033 is 330410111021101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 89441809487424 + 11678301526609 = 9457368^2 + 3417353^2 .

It is a cyclic number.

It is not a de Polignac number, because 101120111014033 - 29 = 101120111013521 is a prime.

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

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

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

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

Almost surely, 2101120111014033 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101120111014033 its reverse (330410111021101), we get a palindrome (431530222035134).

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