Base | Representation |
---|---|
bin | 1010010011100111000111… |
… | …0011110000111011011011 |
3 | 1111010022221212112220111212 |
4 | 2210321301303300323123 |
5 | 2441131000434401021 |
6 | 40033510353413335 |
7 | 2246466226150160 |
oct | 244716163607333 |
9 | 44108855486455 |
10 | 11332033122011 |
11 | 36799852a9968 |
12 | 1330282b6a24b |
13 | 6427b58bb114 |
14 | 2b268ab60067 |
15 | 149b8b1e885b |
hex | a4e71cf0edb |
11332033122011 has 8 divisors (see below), whose sum is σ = 13023246366720. Its totient is φ = 9658907719848.
The previous prime is 11332033121993. The next prime is 11332033122061. The reversal of 11332033122011 is 11022133023311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11332033122011 is a prime.
It is a super-2 number, since 2×113320331220112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11332033122061) 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, 4521959291 + ... + 4521961796.
It is an arithmetic number, because the mean of its divisors is an integer number (1627905795840).
Almost surely, 211332033122011 is an apocalyptic number.
11332033122011 is a deficient number, since it is larger than the sum of its proper divisors (1691213244709).
11332033122011 is an equidigital number, since it uses as much as digits as its factorization.
11332033122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9043921273.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11332033122011 its reverse (11022133023311), we get a palindrome (22354166145322).
The spelling of 11332033122011 in words is "eleven trillion, three hundred thirty-two billion, thirty-three million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •