Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0000111010100010000011 |
3 | 1102222122120120011102021211 |
4 | 2200032320300322202003 |
5 | 2420401213324310201 |
6 | 35230232512430551 |
7 | 2214345230206162 |
oct | 240167060724203 |
9 | 42878516142254 |
10 | 11011101010051 |
11 | 356586650908a |
12 | 129a037548457 |
13 | 61b45b256b5c |
14 | 2a0d23a1b3d9 |
15 | 14165604c651 |
hex | a03b8c3a883 |
11011101010051 has 2 divisors, whose sum is σ = 11011101010052. Its totient is φ = 11011101010050.
The previous prime is 11011101009983. The next prime is 11011101010073. The reversal of 11011101010051 is 15001010111011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011101010051 is a prime.
It is not a weakly prime, because it can be changed into another prime (11011101010951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505550505025 + 5505550505026.
It is an arithmetic number, because the mean of its divisors is an integer number (5505550505026).
Almost surely, 211011101010051 is an apocalyptic number.
11011101010051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011101010051 is an equidigital number, since it uses as much as digits as its factorization.
11011101010051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 11011101010051 its reverse (15001010111011), we get a palindrome (26012111121062).
The spelling of 11011101010051 in words is "eleven trillion, eleven billion, one hundred one million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •