Base | Representation |
---|---|
bin | 1010000010110000001111… |
… | …1101011110010010001001 |
3 | 1110002122102202020002220101 |
4 | 2200230003331132102021 |
5 | 2421404342401130424 |
6 | 35252453205125401 |
7 | 2216534433631453 |
oct | 240540375362211 |
9 | 43078382202811 |
10 | 11042427364489 |
11 | 357808140a904 |
12 | 12a411a6b9861 |
13 | 6213b1353761 |
14 | 2a26562872d3 |
15 | 14238b320344 |
hex | a0b03f5e489 |
11042427364489 has 2 divisors, whose sum is σ = 11042427364490. Its totient is φ = 11042427364488.
The previous prime is 11042427364483. The next prime is 11042427364499. The reversal of 11042427364489 is 98446372424011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8318580798025 + 2723846566464 = 2884195^2 + 1650408^2 .
It is an emirp because it is prime and its reverse (98446372424011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11042427364489 - 211 = 11042427362441 is a prime.
It is a super-2 number, since 2×110424273644892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11042427364483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521213682244 + 5521213682245.
It is an arithmetic number, because the mean of its divisors is an integer number (5521213682245).
Almost surely, 211042427364489 is an apocalyptic number.
It is an amenable number.
11042427364489 is a deficient number, since it is larger than the sum of its proper divisors (1).
11042427364489 is an equidigital number, since it uses as much as digits as its factorization.
11042427364489 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9289728, while the sum is 55.
The spelling of 11042427364489 in words is "eleven trillion, forty-two billion, four hundred twenty-seven million, three hundred sixty-four thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •