Base | Representation |
---|---|
bin | 10100100011001100… |
… | …11101000000100001 |
3 | 1001110212222210120101 |
4 | 22101212131000201 |
5 | 140043333224301 |
6 | 5022433142401 |
7 | 540254332531 |
oct | 122146350041 |
9 | 31425883511 |
10 | 11032711201 |
11 | 4751750246 |
12 | 217a9baa01 |
13 | 106a93b6a5 |
14 | 7693874c1 |
15 | 4488a1701 |
hex | 29199d021 |
11032711201 has 2 divisors, whose sum is σ = 11032711202. Its totient is φ = 11032711200.
The previous prime is 11032711189. The next prime is 11032711211. The reversal of 11032711201 is 10211723011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10724673600 + 308037601 = 103560^2 + 17551^2 .
It is a cyclic number.
It is not a de Polignac number, because 11032711201 - 25 = 11032711169 is a prime.
It is not a weakly prime, because it can be changed into another prime (11032711211) 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 as a sum of consecutive naturals, namely, 5516355600 + 5516355601.
It is an arithmetic number, because the mean of its divisors is an integer number (5516355601).
Almost surely, 211032711201 is an apocalyptic number.
It is an amenable number.
11032711201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032711201 is an equidigital number, since it uses as much as digits as its factorization.
11032711201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
The spelling of 11032711201 in words is "eleven billion, thirty-two million, seven hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •