Search a number
-
+
110201100091031 is a prime number
BaseRepresentation
bin11001000011101000110001…
…011011001011111010010111
3112110012010022010211212210202
4121003220301123023322113
5103421013323110403111
61030213404140411115
732132523664216205
oct3103506133137227
9473163263755722
10110201100091031
113212802a079034
1210439865546a9b
134964bc44a3871
141d2da94186075
15cb18b4539b3b
hex643a316cbe97

110201100091031 has 2 divisors, whose sum is σ = 110201100091032. Its totient is φ = 110201100091030.

The previous prime is 110201100091003. The next prime is 110201100091057. The reversal of 110201100091031 is 130190001102011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110201100091031 - 210 = 110201100090007 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2110201100091031 is an apocalyptic number.

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

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

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

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

Adding to 110201100091031 its reverse (130190001102011), we get a palindrome (240391101193042).

The spelling of 110201100091031 in words is "one hundred ten trillion, two hundred one billion, one hundred million, ninety-one thousand, thirty-one".