Base | Representation |
---|---|
bin | 1010000110010010000001… |
… | …0001111001100010101001 |
3 | 1110022102212101120202111000 |
4 | 2201210200101321202221 |
5 | 2423403002144220314 |
6 | 35340355033225213 |
7 | 2224111325010540 |
oct | 241444021714251 |
9 | 43272771522430 |
10 | 11103032023209 |
11 | 35a0851137a15 |
12 | 12b3a12b62209 |
13 | 62701c14ab69 |
14 | 2a5565177157 |
15 | 143c36bb1209 |
hex | a19204798a9 |
11103032023209 has 32 divisors (see below), whose sum is σ = 19904595229440. Its totient is φ = 5971378565376.
The previous prime is 11103032023147. The next prime is 11103032023211. The reversal of 11103032023209 is 90232023030111.
11103032023209 is a `hidden beast` number, since 1 + 1 + 10 + 3 + 0 + 320 + 2 + 320 + 9 = 666.
It is not a de Polignac number, because 11103032023209 - 27 = 11103032023081 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (11103032023009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1727826234 + ... + 1727832659.
It is an arithmetic number, because the mean of its divisors is an integer number (622018600920).
Almost surely, 211103032023209 is an apocalyptic number.
It is an amenable number.
11103032023209 is a deficient number, since it is larger than the sum of its proper divisors (8801563206231).
11103032023209 is a wasteful number, since it uses less digits than its factorization.
11103032023209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3455658926 (or 3455658920 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The spelling of 11103032023209 in words is "eleven trillion, one hundred three billion, thirty-two million, twenty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •