Search a number
-
+
11011067453 is a prime number
BaseRepresentation
bin10100100000100111…
…11000111000111101
31001102101021011221002
422100103320320331
5140022313124303
65020341220045
7536602346321
oct122023707075
931371234832
1011011067453
114740507a51
122173701625
131066301039
14766551981
15446a28788
hex2904f8e3d

11011067453 has 2 divisors, whose sum is σ = 11011067454. Its totient is φ = 11011067452.

The previous prime is 11011067437. The next prime is 11011067521. The reversal of 11011067453 is 35476011011.

It is a happy number.

11011067453 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10841599129 + 169468324 = 104123^2 + 13018^2 .

It is a cyclic number.

It is not a de Polignac number, because 11011067453 - 24 = 11011067437 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11011060453) 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, 5505533726 + 5505533727.

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

Almost surely, 211011067453 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

Adding to 11011067453 its reverse (35476011011), we get a palindrome (46487078464).

The spelling of 11011067453 in words is "eleven billion, eleven million, sixty-seven thousand, four hundred fifty-three".