Search a number
-
+
11301221032469 is a prime number
BaseRepresentation
bin1010010001110100010101…
…0000111110001000010101
31111000101102112011120201022
42210131011100332020111
52440124400041014334
640011413111410525
72244325535543264
oct244350520761025
944011375146638
1011301221032469
113667903717a55
121326304083a45
1363c9151cc484
142b0da69205db
15148e8615a82e
hexa474543e215

11301221032469 has 2 divisors, whose sum is σ = 11301221032470. Its totient is φ = 11301221032468.

The previous prime is 11301221032403. The next prime is 11301221032501. The reversal of 11301221032469 is 96423012210311.

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., 6115184952100 + 5186036080369 = 2472890^2 + 2277287^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11301221032469 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 211301221032469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15552, while the sum is 35.

The spelling of 11301221032469 in words is "eleven trillion, three hundred one billion, two hundred twenty-one million, thirty-two thousand, four hundred sixty-nine".