Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00001101110110001 |
3 | 1001101200100021020100 |
4 | 22033231201232301 |
5 | 140012224323441 |
6 | 5015341503013 |
7 | 536421023502 |
oct | 121755415661 |
9 | 31350307210 |
10 | 11001011121 |
11 | 4735869531 |
12 | 2170271a69 |
13 | 10641bc949 |
14 | 765094ba9 |
15 | 445bddcb6 |
hex | 28fb61bb1 |
11001011121 has 6 divisors (see below), whose sum is σ = 15890349410. Its totient is φ = 7334007408.
The previous prime is 11001011101. The next prime is 11001011171. The reversal of 11001011121 is 12111010011.
It can be written as a sum of positive squares in only one way, i.e., 7786121121 + 3214890000 = 88239^2 + 56700^2 .
It is not a de Polignac number, because 11001011121 - 25 = 11001011089 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 1222334569 = 11001011121 / (1 + 1 + 0 + 0 + 1 + 0 + 1 + 1 + 1 + 2 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11001011101) 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 in 5 ways as a sum of consecutive naturals, for example, 611167276 + ... + 611167293.
Almost surely, 211001011121 is an apocalyptic number.
It is an amenable number.
11001011121 is a deficient number, since it is larger than the sum of its proper divisors (4889338289).
11001011121 is a wasteful number, since it uses less digits than its factorization.
11001011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1222334575 (or 1222334572 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11001011121 its reverse (12111010011), we get a palindrome (23112021132).
The spelling of 11001011121 in words is "eleven billion, one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •