Search a number
-
+
1101022110031 is a prime number
BaseRepresentation
bin10000000001011010000…
…010000010000101001111
310220020221010100100002211
4100001122002002011033
5121014343130010111
62201445204531251
7142355232343114
oct20013202020517
93806833310084
101101022110031
11394a39306428
121594760b0b27
137ca977870cc
143b40b12c90b
151d99059d521
hex1005a08214f

1101022110031 has 2 divisors, whose sum is σ = 1101022110032. Its totient is φ = 1101022110030.

The previous prime is 1101022109977. The next prime is 1101022110043. The reversal of 1101022110031 is 1300112201011.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1101022110031 - 27 = 1101022109903 is a prime.

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

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 21101022110031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 1101022110031 its reverse (1300112201011), we get a palindrome (2401134311042).

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