Search a number
-
+
201033033121031 is a prime number
BaseRepresentation
bin101101101101011010100110…
…100001101111110100000111
3222100210120101201200220021112
4231231122212201233310013
5202322211122434333111
61551321144522235235
760226104653053046
oct5555324641576407
9870716351626245
10201033033121031
11590676a3304a71
121a669670055b1b
13882344512c787
14379009d26055d
1518394e5866e8b
hexb6d6a686fd07

201033033121031 has 2 divisors, whose sum is σ = 201033033121032. Its totient is φ = 201033033121030.

The previous prime is 201033033121001. The next prime is 201033033121057. The reversal of 201033033121031 is 130121330330102.

It is a strong prime.

It is a cyclic number.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 2201033033121031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 23.

Adding to 201033033121031 its reverse (130121330330102), we get a palindrome (331154363451133).

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