Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110101001101000110101 |
3 | 1111010020122002010102002120 |
4 | 2210320330012221220311 |
5 | 2441122124304300341 |
6 | 40033241125430153 |
7 | 2246435005466220 |
oct | 244707406515065 |
9 | 44106562112076 |
10 | 11331132103221 |
11 | 3679562741137 |
12 | 133007126b359 |
13 | 6426a1028ac8 |
14 | 2b260321a5b7 |
15 | 149b3706a066 |
hex | a4e3c1a9a35 |
11331132103221 has 8 divisors (see below), whose sum is σ = 17266487014464. Its totient is φ = 6474932630400.
The previous prime is 11331132103219. The next prime is 11331132103229. The reversal of 11331132103221 is 12230123113311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11331132103221 - 21 = 11331132103219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11331132103191 and 11331132103200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11331132103229) 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, 269788859580 + ... + 269788859621.
It is an arithmetic number, because the mean of its divisors is an integer number (2158310876808).
Almost surely, 211331132103221 is an apocalyptic number.
It is an amenable number.
11331132103221 is a deficient number, since it is larger than the sum of its proper divisors (5935354911243).
11331132103221 is an equidigital number, since it uses as much as digits as its factorization.
11331132103221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539577719211.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 11331132103221 its reverse (12230123113311), we get a palindrome (23561255216532).
The spelling of 11331132103221 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, one hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •