Base | Representation |
---|---|
bin | 1010000011010001001010… |
… | …1111001010010000110101 |
3 | 1110010111020200011221022212 |
4 | 2200310102233022100311 |
5 | 2422030442343032201 |
6 | 35300514154503205 |
7 | 2220266440221266 |
oct | 240642257122065 |
9 | 43114220157285 |
10 | 11051265205301 |
11 | 35808a7114482 |
12 | 12a5986434b05 |
13 | 62218c338569 |
14 | 2a2c53d2a96d |
15 | 142707169abb |
hex | a0d12bca435 |
11051265205301 has 2 divisors, whose sum is σ = 11051265205302. Its totient is φ = 11051265205300.
The previous prime is 11051265205207. The next prime is 11051265205303. The reversal of 11051265205301 is 10350256215011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10988900132401 + 62365072900 = 3314951^2 + 249730^2 .
It is a cyclic number.
It is not a de Polignac number, because 11051265205301 - 222 = 11051261010997 is a prime.
Together with 11051265205303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11051265205303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5525632602650 + 5525632602651.
It is an arithmetic number, because the mean of its divisors is an integer number (5525632602651).
Almost surely, 211051265205301 is an apocalyptic number.
It is an amenable number.
11051265205301 is a deficient number, since it is larger than the sum of its proper divisors (1).
11051265205301 is an equidigital number, since it uses as much as digits as its factorization.
11051265205301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 32.
The spelling of 11051265205301 in words is "eleven trillion, fifty-one billion, two hundred sixty-five million, two hundred five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •