Base | Representation |
---|---|
bin | 1010000000111000001100… |
… | …0011111000000100101011 |
3 | 1102222120020202202221000111 |
4 | 2200032003003320010223 |
5 | 2420342342200323201 |
6 | 35230003245115151 |
7 | 2214314006640013 |
oct | 240160303700453 |
9 | 42876222687014 |
10 | 11010200011051 |
11 | 356544396420a |
12 | 1299a25858ab7 |
13 | 61b3466a0857 |
14 | 2a0c7a0c0c43 |
15 | 141601dc4b51 |
hex | a03830f812b |
11010200011051 has 2 divisors, whose sum is σ = 11010200011052. Its totient is φ = 11010200011050.
The previous prime is 11010200011049. The next prime is 11010200011159. The reversal of 11010200011051 is 15011000201011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11010200011051 - 21 = 11010200011049 is a prime.
Together with 11010200011049, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11010200081051) 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, 5505100005525 + 5505100005526.
It is an arithmetic number, because the mean of its divisors is an integer number (5505100005526).
Almost surely, 211010200011051 is an apocalyptic number.
11010200011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010200011051 is an equidigital number, since it uses as much as digits as its factorization.
11010200011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 13.
Adding to 11010200011051 its reverse (15011000201011), we get a palindrome (26021200212062).
The spelling of 11010200011051 in words is "eleven trillion, ten billion, two hundred million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •