Search a number
-
+
11022004031 is a prime number
BaseRepresentation
bin10100100001111011…
…00110111100111111
31001110010211211002112
422100331212330333
5140033113112111
65021411444235
7540064326353
oct122075467477
931403754075
1011022004031
1147466a7845
1221772b667b
13106865cc9c
14767b9b463
15447988e8b
hex290f66f3f

11022004031 has 2 divisors, whose sum is σ = 11022004032. Its totient is φ = 11022004030.

The previous prime is 11022004013. The next prime is 11022004033. The reversal of 11022004031 is 13040022011.

Together with previous prime (11022004013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is an emirp because it is prime and its reverse (13040022011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11022004031 - 226 = 10954895167 is a prime.

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

Together with 11022004033, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 211022004031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 14.

Adding to 11022004031 its reverse (13040022011), we get a palindrome (24062026042).

The spelling of 11022004031 in words is "eleven billion, twenty-two million, four thousand, thirty-one".