Search a number
-
+
111320020211033 is a prime number
BaseRepresentation
bin11001010011111010110110…
…010000101101010101011001
3112121011002102121110022220202
4121103322312100231111121
5104042331400133223113
61032431413350031545
732306414606263364
oct3123726620552531
9477132377408822
10111320020211033
1132519612336237
121059a6956485b5
134a16581ccb9ca
141d6bcbc3530db
15cd0a51047258
hex653eb642d559

111320020211033 has 2 divisors, whose sum is σ = 111320020211034. Its totient is φ = 111320020211032.

The previous prime is 111320020210999. The next prime is 111320020211129. The reversal of 111320020211033 is 330112020023111.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 111273869141449 + 46151069584 = 10548643^2 + 214828^2 .

It is a cyclic number.

It is not a de Polignac number, because 111320020211033 - 242 = 106921973699929 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 111320020210996 and 111320020211014.

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

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

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

Almost surely, 2111320020211033 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 216, while the sum is 20.

Adding to 111320020211033 its reverse (330112020023111), we get a palindrome (441432040234144).

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