Search a number
-
+
110101001001031 is a prime number
BaseRepresentation
bin11001000010001011100011…
…000011011101100001000111
3112102211112221001202020122001
4121002023203003131201013
5103412343322224013111
61030055411313450131
732122351305045445
oct3102134303354107
9472745831666561
10110101001001031
1132099632813177
121042238a570947
1349586312ab8b1
141d28cb9ccdb95
15cadea677a1c1
hex6422e30dd847

110101001001031 has 2 divisors, whose sum is σ = 110101001001032. Its totient is φ = 110101001001030.

The previous prime is 110101001001007. The next prime is 110101001001037. The reversal of 110101001001031 is 130100100101011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110101001001031 - 29 = 110101001000519 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2110101001001031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 110101001001031 its reverse (130100100101011), we get a palindrome (240201101102042).

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