Search a number
-
+
1101422011 is a prime number
BaseRepresentation
bin100000110100110…
…0101110110111011
32211202112000221211
41001221211312323
54223431001021
6301143143551
736202634614
oct10151456673
92752460854
101101422011
115157a6728
12268a44bb7
1314725b001
14a63ccc0b
1566a673e1
hex41a65dbb

1101422011 has 2 divisors, whose sum is σ = 1101422012. Its totient is φ = 1101422010.

The previous prime is 1101421921. The next prime is 1101422041. The reversal of 1101422011 is 1102241011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1101422011 - 219 = 1100897723 is a prime.

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

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

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

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

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

Almost surely, 21101422011 is an apocalyptic number.

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

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

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

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

The square root of 1101422011 is about 33187.6786021560. The cubic root of 1101422011 is about 1032.7247462415.

Adding to 1101422011 its reverse (1102241011), we get a palindrome (2203663022).

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