Base | Representation |
---|---|
bin | 1010010011011111101010… |
… | …0110000001111100110011 |
3 | 1111010010210111000212012111 |
4 | 2210313322212001330303 |
5 | 2441112401424024021 |
6 | 40032540104510151 |
7 | 2246365531525000 |
oct | 244677246017463 |
9 | 44103714025174 |
10 | 11330033033011 |
11 | 3679049301450 |
12 | 132ba0517b357 |
13 | 6425574123c4 |
14 | 2b253b2808a7 |
15 | 149ac08198e1 |
hex | a4dfa981f33 |
11330033033011 has 32 divisors (see below), whose sum is σ = 14477535244800. Its totient is φ = 8789704005600.
The previous prime is 11330033033003. The next prime is 11330033033017. The reversal of 11330033033011 is 11033033003311.
It is not a de Polignac number, because 11330033033011 - 23 = 11330033033003 is a prime.
It is a super-2 number, since 2×113300330330112 (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 (11330033033017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5757900 + ... + 7470841.
It is an arithmetic number, because the mean of its divisors is an integer number (452422976400).
Almost surely, 211330033033011 is an apocalyptic number.
11330033033011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11330033033011 is a deficient number, since it is larger than the sum of its proper divisors (3147502211789).
11330033033011 is a wasteful number, since it uses less digits than its factorization.
11330033033011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13229000 (or 13228986 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 22.
Adding to 11330033033011 its reverse (11033033003311), we get a palindrome (22363066036322).
The spelling of 11330033033011 in words is "eleven trillion, three hundred thirty billion, thirty-three million, thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •