Search a number
-
+
11022120121013 is a prime number
BaseRepresentation
bin1010000001100100100110…
…0011011111001010110101
31110000201000111120020211122
42200121021203133022311
52421041300222333023
635235254142313325
72215215261126131
oct240311143371265
943021014506748
1011022120121013
11356a50050a261
1212a01b1888845
1361c4c6113061
142a168b2643c1
15141a9d6142c8
hexa06498df2b5

11022120121013 has 2 divisors, whose sum is σ = 11022120121014. Its totient is φ = 11022120121012.

The previous prime is 11022120120889. The next prime is 11022120121093. The reversal of 11022120121013 is 31012102122011.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7497481851409 + 3524638269604 = 2738153^2 + 1877402^2 .

It is a cyclic number.

It is not a de Polignac number, because 11022120121013 - 214 = 11022120104629 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 211022120121013 is an apocalyptic number.

It is an amenable number.

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

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

11022120121013 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 17.

Adding to 11022120121013 its reverse (31012102122011), we get a palindrome (42034222243024).

The spelling of 11022120121013 in words is "eleven trillion, twenty-two billion, one hundred twenty million, one hundred twenty-one thousand, thirteen".