Base | Representation |
---|---|
bin | 1010000010001010001100… |
… | …0001010000010010100001 |
3 | 1110001200001202101121022000 |
4 | 2200202203001100102201 |
5 | 2421222432010444301 |
6 | 35244043333434213 |
7 | 2216023321344303 |
oct | 240424301202241 |
9 | 43050052347260 |
10 | 11032211031201 |
11 | 3573809577458 |
12 | 12a214919b969 |
13 | 6204438b0829 |
14 | 2a1d674cd973 |
15 | 141e8e47d786 |
hex | a08a30504a1 |
11032211031201 has 32 divisors (see below), whose sum is σ = 16674393525120. Its totient is φ = 7206504282432.
The previous prime is 11032211031199. The next prime is 11032211031229. The reversal of 11032211031201 is 10213011223011.
11032211031201 is a `hidden beast` number, since 1 + 1 + 0 + 322 + 110 + 31 + 201 = 666.
It is not a de Polignac number, because 11032211031201 - 21 = 11032211031199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11032211032201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4008835 + ... + 6175368.
It is an arithmetic number, because the mean of its divisors is an integer number (521074797660).
Almost surely, 211032211031201 is an apocalyptic number.
It is an amenable number.
11032211031201 is a deficient number, since it is larger than the sum of its proper divisors (5642182493919).
11032211031201 is a wasteful number, since it uses less digits than its factorization.
11032211031201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10185022 (or 10185016 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11032211031201 its reverse (10213011223011), we get a palindrome (21245222254212).
The spelling of 11032211031201 in words is "eleven trillion, thirty-two billion, two hundred eleven million, thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •