Base | Representation |
---|---|
bin | 10100101100011101… |
… | …10100100101101001 |
3 | 1001200022011220212112 |
4 | 22112032310211221 |
5 | 140223230334114 |
6 | 5034250252105 |
7 | 542216601521 |
oct | 122616644551 |
9 | 31608156775 |
10 | 11110402409 |
11 | 4791594857 |
12 | 21a0a27035 |
13 | 1080a70c12 |
14 | 77580c681 |
15 | 4505eb13e |
hex | 2963b4969 |
11110402409 has 2 divisors, whose sum is σ = 11110402410. Its totient is φ = 11110402408.
The previous prime is 11110402313. The next prime is 11110402421. The reversal of 11110402409 is 90420401111.
11110402409 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., 8054524009 + 3055878400 = 89747^2 + 55280^2 .
It is an emirp because it is prime and its reverse (90420401111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11110402409 - 220 = 11109353833 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11110402469) 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, 5555201204 + 5555201205.
It is an arithmetic number, because the mean of its divisors is an integer number (5555201205).
Almost surely, 211110402409 is an apocalyptic number.
It is an amenable number.
11110402409 is a deficient number, since it is larger than the sum of its proper divisors (1).
11110402409 is an equidigital number, since it uses as much as digits as its factorization.
11110402409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 11110402409 in words is "eleven billion, one hundred ten million, four hundred two thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •