Base | Representation |
---|---|
bin | 1010000011011001111100… |
… | …1010010011101111001001 |
3 | 1110010201022212021102111220 |
4 | 2200312133022103233021 |
5 | 2422100304002212413 |
6 | 35301544034312253 |
7 | 2220412015244031 |
oct | 240663712235711 |
9 | 43121285242456 |
10 | 11053621132233 |
11 | 35818a5a64229 |
12 | 12a6323428689 |
13 | 622476462774 |
14 | 2a2dd8b968c1 |
15 | 1427e3dd7223 |
hex | a0d9f293bc9 |
11053621132233 has 16 divisors (see below), whose sum is σ = 14786281665792. Its totient is φ = 7345052912000.
The previous prime is 11053621132217. The next prime is 11053621132237. The reversal of 11053621132233 is 33223112635011.
It is a cyclic number.
It is not a de Polignac number, because 11053621132233 - 24 = 11053621132217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11053621132194 and 11053621132203.
It is not an unprimeable number, because it can be changed into a prime (11053621132237) 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 15 ways as a sum of consecutive naturals, for example, 2656788 + ... + 5400533.
It is an arithmetic number, because the mean of its divisors is an integer number (924142604112).
Almost surely, 211053621132233 is an apocalyptic number.
It is an amenable number.
11053621132233 is a deficient number, since it is larger than the sum of its proper divisors (3732660533559).
11053621132233 is a wasteful number, since it uses less digits than its factorization.
11053621132233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8058816.
The product of its (nonzero) digits is 19440, while the sum is 33.
Adding to 11053621132233 its reverse (33223112635011), we get a palindrome (44276733767244).
The spelling of 11053621132233 in words is "eleven trillion, fifty-three billion, six hundred twenty-one million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •