Base | Representation |
---|---|
bin | 1010000111011001001000… |
… | …0111011010110110010001 |
3 | 1110101021010210021020200211 |
4 | 2201312102013122312101 |
5 | 2424211101131412412 |
6 | 35353233204244121 |
7 | 2225355355001461 |
oct | 241662207326621 |
9 | 43337123236624 |
10 | 11122121747857 |
11 | 35a895785665a |
12 | 12b76600a0641 |
13 | 628a72072113 |
14 | 2a64565c9ba1 |
15 | 1444a2a70ca7 |
hex | a1d921dad91 |
11122121747857 has 2 divisors, whose sum is σ = 11122121747858. Its totient is φ = 11122121747856.
The previous prime is 11122121747851. The next prime is 11122121747897. The reversal of 11122121747857 is 75874712122111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7633859547136 + 3488262200721 = 2762944^2 + 1867689^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122121747857 - 27 = 11122121747729 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11122121747857.
It is not a weakly prime, because it can be changed into another prime (11122121747851) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561060873928 + 5561060873929.
It is an arithmetic number, because the mean of its divisors is an integer number (5561060873929).
Almost surely, 211122121747857 is an apocalyptic number.
It is an amenable number.
11122121747857 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122121747857 is an equidigital number, since it uses as much as digits as its factorization.
11122121747857 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 439040, while the sum is 49.
Adding to 11122121747857 its reverse (75874712122111), we get a palindrome (86996833869968).
The spelling of 11122121747857 in words is "eleven trillion, one hundred twenty-two billion, one hundred twenty-one million, seven hundred forty-seven thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •