Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …1001110101100101111001 |
3 | 1110022011001210010122001221 |
4 | 2201201230021311211321 |
5 | 2423330310030323001 |
6 | 35335135121112041 |
7 | 2223643411225402 |
oct | 241415411654571 |
9 | 43264053118057 |
10 | 11100010011001 |
11 | 359a54030246a |
12 | 12b330aa88621 |
13 | 62695a02a362 |
14 | 2a5359a809a9 |
15 | 143b0b7201a1 |
hex | a186c275979 |
11100010011001 has 8 divisors (see below), whose sum is σ = 11759828900040. Its totient is φ = 10440955246848.
The previous prime is 11100010010983. The next prime is 11100010011007. The reversal of 11100010011001 is 10011001000111.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2674336915600 + 8425673095401 = 1635340^2 + 2902701^2 .
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 11100010011001 - 211 = 11100010008953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11100010011007) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 191001306 + ... + 191059411.
It is an arithmetic number, because the mean of its divisors is an integer number (1469978612505).
Almost surely, 211100010011001 is an apocalyptic number.
It is an amenable number.
11100010011001 is a deficient number, since it is larger than the sum of its proper divisors (659818889039).
11100010011001 is a wasteful number, since it uses less digits than its factorization.
11100010011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382062443.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11100010011001 its reverse (10011001000111), we get a palindrome (21111011011112).
The spelling of 11100010011001 in words is "eleven trillion, one hundred billion, ten million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •