Search a number
-
+
11402302361 is a prime number
BaseRepresentation
bin10101001111010000…
…10101001110011001
31002102122102222022212
422213220111032121
5141322442133421
65123234524505
7552362654012
oct124750251631
932378388285
1011402302361
11492133658a
122262736735
1310c9393b98
147a24b4009
1546b059e5b
hex2a7a15399

11402302361 has 2 divisors, whose sum is σ = 11402302362. Its totient is φ = 11402302360.

The previous prime is 11402302333. The next prime is 11402302409. The reversal of 11402302361 is 16320320411.

11402302361 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., 11320960000 + 81342361 = 106400^2 + 9019^2 .

It is an emirp because it is prime and its reverse (16320320411) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11402302361 - 230 = 10328560537 is a prime.

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

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

Almost surely, 211402302361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 23.

Adding to 11402302361 its reverse (16320320411), we get a palindrome (27722622772).

The spelling of 11402302361 in words is "eleven billion, four hundred two million, three hundred two thousand, three hundred sixty-one".