Base | Representation |
---|---|
bin | 1010001100001011011011… |
… | …1101101100001110011001 |
3 | 1110200010101000120100121210 |
4 | 2203002312331230032121 |
5 | 2432032444122130314 |
6 | 35455112115453333 |
7 | 2234326045306656 |
oct | 243026675541631 |
9 | 43603330510553 |
10 | 11204344333209 |
11 | 362a810308a35 |
12 | 130b5882b7249 |
13 | 6337467b56a1 |
14 | 2aa416600c2d |
15 | 1466b621d559 |
hex | a30b6f6c399 |
11204344333209 has 8 divisors (see below), whose sum is σ = 15087037914432. Its totient is φ = 7395606820400.
The previous prime is 11204344333141. The next prime is 11204344333243. The reversal of 11204344333209 is 90233344340211.
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 11204344333209 - 27 = 11204344333081 is a prime.
It is a super-2 number, since 2×112043443332092 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11204344333249) 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, 18489016749 + ... + 18489017354.
It is an arithmetic number, because the mean of its divisors is an integer number (1885879739304).
Almost surely, 211204344333209 is an apocalyptic number.
It is an amenable number.
11204344333209 is a deficient number, since it is larger than the sum of its proper divisors (3882693581223).
11204344333209 is a wasteful number, since it uses less digits than its factorization.
11204344333209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36978034207.
The product of its (nonzero) digits is 186624, while the sum is 39.
The spelling of 11204344333209 in words is "eleven trillion, two hundred four billion, three hundred forty-four million, three hundred thirty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •