Base | Representation |
---|---|
bin | 10101001111010001… |
… | …10010101100100101 |
3 | 1002102122200002220211 |
4 | 22213220302230211 |
5 | 141323010014302 |
6 | 5123241255421 |
7 | 552363665653 |
oct | 124750625445 |
9 | 32378602824 |
10 | 11402423077 |
11 | 4921409251 |
12 | 2262794571 |
13 | 10c9406b06 |
14 | 7a2505dd3 |
15 | 46b080ad7 |
hex | 2a7a32b25 |
11402423077 has 2 divisors, whose sum is σ = 11402423078. Its totient is φ = 11402423076.
The previous prime is 11402423063. The next prime is 11402423083. The reversal of 11402423077 is 77032420411.
11402423077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6632310721 + 4770112356 = 81439^2 + 69066^2 .
It is a cyclic number.
It is not a de Polignac number, because 11402423077 - 219 = 11401898789 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11402423017) 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, 5701211538 + 5701211539.
It is an arithmetic number, because the mean of its divisors is an integer number (5701211539).
Almost surely, 211402423077 is an apocalyptic number.
It is an amenable number.
11402423077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11402423077 is an equidigital number, since it uses as much as digits as its factorization.
11402423077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9408, while the sum is 31.
Adding to 11402423077 its reverse (77032420411), we get a palindrome (88434843488).
The spelling of 11402423077 in words is "eleven billion, four hundred two million, four hundred twenty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •