Base | Representation |
---|---|
bin | 1010000000111100011000… |
… | …0000111001010110011011 |
3 | 1102222200011001110002022222 |
4 | 2200033012000321112123 |
5 | 2420402142231201243 |
6 | 35230310533134255 |
7 | 2214353566523420 |
oct | 240170600712633 |
9 | 42880131402288 |
10 | 11011323303323 |
11 | 356596aa38332 |
12 | 129a099a8a38b |
13 | 61b495318335 |
14 | 2a0d45363d47 |
15 | 14166a80c168 |
hex | a03c603959b |
11011323303323 has 16 divisors (see below), whose sum is σ = 13311399783936. Its totient is φ = 8904247133760.
The previous prime is 11011323303293. The next prime is 11011323303341. The reversal of 11011323303323 is 32330332311011.
It is a cyclic number.
It is not a de Polignac number, because 11011323303323 - 26 = 11011323303259 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011323303292 and 11011323303301.
It is not an unprimeable number, because it can be changed into a prime (11011323303023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 468435593 + ... + 468459098.
It is an arithmetic number, because the mean of its divisors is an integer number (831962486496).
Almost surely, 211011323303323 is an apocalyptic number.
11011323303323 is a deficient number, since it is larger than the sum of its proper divisors (2300076480613).
11011323303323 is an equidigital number, since it uses as much as digits as its factorization.
11011323303323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 936894794.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 11011323303323 its reverse (32330332311011), we get a palindrome (43341655614334).
The spelling of 11011323303323 in words is "eleven trillion, eleven billion, three hundred twenty-three million, three hundred three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •