Base | Representation |
---|---|
bin | 1010010011100111010111… |
… | …0111100000001110101001 |
3 | 1111010100010121200012010002 |
4 | 2210321311313200032221 |
5 | 2441131120402223144 |
6 | 40033521225032345 |
7 | 2246501013664403 |
oct | 244716567401651 |
9 | 44110117605102 |
10 | 11332101211049 |
11 | 3679a0a7851a3 |
12 | 13302a19256b5 |
13 | 6427c6a3aba8 |
14 | 2b2695c05b73 |
15 | 149b9219814e |
hex | a4e75de03a9 |
11332101211049 has 2 divisors, whose sum is σ = 11332101211050. Its totient is φ = 11332101211048.
The previous prime is 11332101211001. The next prime is 11332101211097. The reversal of 11332101211049 is 94011210123311.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (11332101211001) and next prime (11332101211097).
It can be written as a sum of positive squares in only one way, i.e., 8211692016025 + 3120409195024 = 2865605^2 + 1766468^2 .
It is a cyclic number.
It is not a de Polignac number, because 11332101211049 - 232 = 11327806243753 is a prime.
It is not a weakly prime, because it can be changed into another prime (11332101213049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5666050605524 + 5666050605525.
It is an arithmetic number, because the mean of its divisors is an integer number (5666050605525).
Almost surely, 211332101211049 is an apocalyptic number.
It is an amenable number.
11332101211049 is a deficient number, since it is larger than the sum of its proper divisors (1).
11332101211049 is an equidigital number, since it uses as much as digits as its factorization.
11332101211049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
The spelling of 11332101211049 in words is "eleven trillion, three hundred thirty-two billion, one hundred one million, two hundred eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •