Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0011100101110010011001 |
3 | 1102222122121012021020112002 |
4 | 2200032321103211302121 |
5 | 2420401223141200441 |
6 | 35230233435330345 |
7 | 2214345400365635 |
oct | 240167123456231 |
9 | 42878535236462 |
10 | 11011110100121 |
11 | 356587065763a |
12 | 129a03a5b09b5 |
13 | 61b4600ba4b1 |
14 | 2a0d24d05dc5 |
15 | 141656c45b9b |
hex | a03b94e5c99 |
11011110100121 has 2 divisors, whose sum is σ = 11011110100122. Its totient is φ = 11011110100120.
The previous prime is 11011110100097. The next prime is 11011110100129. The reversal of 11011110100121 is 12100101111011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10855779525721 + 155330574400 = 3294811^2 + 394120^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011110100121 - 214 = 11011110083737 is a prime.
It is not a weakly prime, because it can be changed into another prime (11011110100129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505555050060 + 5505555050061.
It is an arithmetic number, because the mean of its divisors is an integer number (5505555050061).
Almost surely, 211011110100121 is an apocalyptic number.
It is an amenable number.
11011110100121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011110100121 is an equidigital number, since it uses as much as digits as its factorization.
11011110100121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11011110100121 its reverse (12100101111011), we get a palindrome (23111211211132).
The spelling of 11011110100121 in words is "eleven trillion, eleven billion, one hundred ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •