Base | Representation |
---|---|
bin | 1010010011100111000111… |
… | …0100001001001000001101 |
3 | 1111010022221212201221111001 |
4 | 2210321301310021020031 |
5 | 2441131001001034013 |
6 | 40033510355500301 |
7 | 2246466230042152 |
oct | 244716164111015 |
9 | 44108855657431 |
10 | 11332033221133 |
11 | 3679985367389 |
12 | 1330282bb7691 |
13 | 6427b5924281 |
14 | 2b268ab88229 |
15 | 149b8b217ddd |
hex | a4e71d0920d |
11332033221133 has 16 divisors (see below), whose sum is σ = 11952641765376. Its totient is φ = 10722315043440.
The previous prime is 11332033221079. The next prime is 11332033221161. The reversal of 11332033221133 is 33112233023311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11332033221133 - 29 = 11332033220621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11332033221233) 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, 467235 + ... + 4783552.
It is an arithmetic number, because the mean of its divisors is an integer number (747040110336).
Almost surely, 211332033221133 is an apocalyptic number.
It is an amenable number.
11332033221133 is a deficient number, since it is larger than the sum of its proper divisors (620608544243).
11332033221133 is a wasteful number, since it uses less digits than its factorization.
11332033221133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5251824.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 11332033221133 its reverse (33112233023311), we get a palindrome (44444266244444).
The spelling of 11332033221133 in words is "eleven trillion, three hundred thirty-two billion, thirty-three million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •