Base | Representation |
---|---|
bin | 11101011011010110111… |
… | …01000111101010000011 |
3 | 10120122212200212112221210 |
4 | 32231223131013222003 |
5 | 113031233222011321 |
6 | 2052300245021203 |
7 | 133023333062301 |
oct | 16555335075203 |
9 | 3518780775853 |
10 | 1011120110211 |
11 | 35a8a4a40322 |
12 | 143b660b4803 |
13 | 7446b058303 |
14 | 36d1d261271 |
15 | 1b47cb2db76 |
hex | eb6b747a83 |
1011120110211 has 8 divisors (see below), whose sum is σ = 1348216516944. Its totient is φ = 674051888480.
The previous prime is 1011120110159. The next prime is 1011120110227. The reversal of 1011120110211 is 1120110211101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1011120110211 - 217 = 1011119979139 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1011120110261) 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 in 7 ways as a sum of consecutive naturals, for example, 6962400 + ... + 7106141.
It is an arithmetic number, because the mean of its divisors is an integer number (168527064618).
Almost surely, 21011120110211 is an apocalyptic number.
1011120110211 is a deficient number, since it is larger than the sum of its proper divisors (337096406733).
1011120110211 is a wasteful number, since it uses less digits than its factorization.
1011120110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14092501.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1011120110211 its reverse (1120110211101), we get a palindrome (2131230321312).
It can be divided in two parts, 101 and 1120110211, that multiplied together give a palindrome (113131131311).
The spelling of 1011120110211 in words is "one trillion, eleven billion, one hundred twenty million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •