Search a number
-
+
11013113269 is a prime number
BaseRepresentation
bin10100100000110111…
…01100010110110101
31001102112010010021001
422100123230112311
5140023324111034
65020453123301
7536625626644
oct122033542665
931375103231
1011013113269
114741685004
122174329531
131066869292
1476692535b
15446ccea14
hex2906ec5b5

11013113269 has 2 divisors, whose sum is σ = 11013113270. Its totient is φ = 11013113268.

The previous prime is 11013113257. The next prime is 11013113303. The reversal of 11013113269 is 96231131011.

11013113269 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., 11005059025 + 8054244 = 104905^2 + 2838^2 .

It is a cyclic number.

It is not a de Polignac number, because 11013113269 - 29 = 11013112757 is a prime.

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

It is a congruent number.

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

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

Almost surely, 211013113269 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 28.

The spelling of 11013113269 in words is "eleven billion, thirteen million, one hundred thirteen thousand, two hundred sixty-nine".