Base | Representation |
---|---|
bin | 1010100011110000000100… |
… | …0110111100010100000000 |
3 | 1112002211200010200211110200 |
4 | 2220330001012330110000 |
5 | 3010201334142320313 |
6 | 40405125030525200 |
7 | 2305513440001530 |
oct | 250740106742400 |
9 | 45084603624420 |
10 | 11609315198208 |
11 | 3776534858822 |
12 | 1375b68206800 |
13 | 6629a4c21260 |
14 | 2c1c72a3d4c0 |
15 | 151eb9215b73 |
hex | a8f011bc500 |
11609315198208 has 216 divisors, whose sum is σ = 41196945648768. Its totient is φ = 3061797359616.
The previous prime is 11609315198203. The next prime is 11609315198209. The reversal of 11609315198208 is 80289151390611.
It is a happy number.
11609315198208 is a `hidden beast` number, since 1 + 1 + 609 + 3 + 1 + 5 + 1 + 9 + 8 + 20 + 8 = 666.
It is a super-2 number, since 2×116093151982082 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11609315198203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27475860 + ... + 27895187.
Almost surely, 211609315198208 is an apocalyptic number.
11609315198208 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
11609315198208 is an abundant number, since it is smaller than the sum of its proper divisors (29587630450560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11609315198208 is a wasteful number, since it uses less digits than its factorization.
11609315198208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55371089 (or 55371072 counting only the distinct ones).
The product of its (nonzero) digits is 933120, while the sum is 54.
The spelling of 11609315198208 in words is "eleven trillion, six hundred nine billion, three hundred fifteen million, one hundred ninety-eight thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •