Base | Representation |
---|---|
bin | 11101011011010110111… |
… | …01100000010001111101 |
3 | 10120122212201001200022021 |
4 | 32231223131200101331 |
5 | 113031233233223234 |
6 | 2052300251120141 |
7 | 133023333662323 |
oct | 16555335402175 |
9 | 3518781050267 |
10 | 1011120211069 |
11 | 35a8a4aaa081 |
12 | 143b66143051 |
13 | 7446b0921a7 |
14 | 36d1d289d13 |
15 | 1b47cb4d9b4 |
hex | eb6b76047d |
1011120211069 has 2 divisors, whose sum is σ = 1011120211070. Its totient is φ = 1011120211068.
The previous prime is 1011120211067. The next prime is 1011120211121. The reversal of 1011120211069 is 9601120211101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1004154305625 + 6965905444 = 1002075^2 + 83462^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011120211069 - 21 = 1011120211067 is a prime.
It is a super-2 number, since 2×10111202110692 (a number of 25 digits) contains 22 as substring.
Together with 1011120211067, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011120211063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505560105534 + 505560105535.
It is an arithmetic number, because the mean of its divisors is an integer number (505560105535).
Almost surely, 21011120211069 is an apocalyptic number.
It is an amenable number.
1011120211069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011120211069 is an equidigital number, since it uses as much as digits as its factorization.
1011120211069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 25.
The spelling of 1011120211069 in words is "one trillion, eleven billion, one hundred twenty million, two hundred eleven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •