Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1101011111000010011001 |
3 | 1102222122120111110202000200 |
4 | 2200032320231133002121 |
5 | 2420401213112023001 |
6 | 35230232441252413 |
7 | 2214345216443064 |
oct | 240167055370231 |
9 | 42878514422020 |
10 | 11011100111001 |
11 | 3565865a54671 |
12 | 129a037194109 |
13 | 61b45b000883 |
14 | 2a0d238658db |
15 | 141655e21086 |
hex | a03b8b5f099 |
11011100111001 has 12 divisors (see below), whose sum is σ = 16596440747328. Its totient is φ = 7021571085144.
The previous prime is 11011100110931. The next prime is 11011100111003. The reversal of 11011100111001 is 10011100111011.
It is not a de Polignac number, because 11011100111001 - 27 = 11011100110873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (11011100111003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26596859965 + ... + 26596860378.
It is an arithmetic number, because the mean of its divisors is an integer number (1383036728944).
Almost surely, 211011100111001 is an apocalyptic number.
It is an amenable number.
11011100111001 is a deficient number, since it is larger than the sum of its proper divisors (5585340636327).
11011100111001 is a wasteful number, since it uses less digits than its factorization.
11011100111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53193720372 (or 53193720369 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 11011100111001 its reverse (10011100111011), we get a palindrome (21022200222012).
It can be divided in two parts, 11011 and 100111001, that multiplied together give a palindrome (1102322232011).
The spelling of 11011100111001 in words is "eleven trillion, eleven billion, one hundred million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •