Base | Representation |
---|---|
bin | 1010000000101011000000… |
… | …0100111101110101011111 |
3 | 1102222020010002012012002121 |
4 | 2200022300010331311133 |
5 | 2420313120014213343 |
6 | 35224220121003411 |
7 | 2214130205633023 |
oct | 240126004756537 |
9 | 42866102165077 |
10 | 11006660304223 |
11 | 3563997887071 |
12 | 12991b8323567 |
13 | 61ac01240c7c |
14 | 2a0a21d48383 |
15 | 141496272aed |
hex | a02b013dd5f |
11006660304223 has 8 divisors (see below), whose sum is σ = 11177045366400. Its totient is φ = 10836805212288.
The previous prime is 11006660304217. The next prime is 11006660304247. The reversal of 11006660304223 is 32240306660011.
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 11006660304223 - 25 = 11006660304191 is a prime.
It is a super-2 number, since 2×110066603042232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11006660304323) 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, 132450703 + ... + 132533776.
It is an arithmetic number, because the mean of its divisors is an integer number (1397130670800).
Almost surely, 211006660304223 is an apocalyptic number.
11006660304223 is a deficient number, since it is larger than the sum of its proper divisors (170385062177).
11006660304223 is an equidigital number, since it uses as much as digits as its factorization.
11006660304223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264985121.
The product of its (nonzero) digits is 31104, while the sum is 34.
Adding to 11006660304223 its reverse (32240306660011), we get a palindrome (43246966964234).
The spelling of 11006660304223 in words is "eleven trillion, six billion, six hundred sixty million, three hundred four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •