Base | Representation |
---|---|
bin | 1010000010000101101110… |
… | …0000101110000011000001 |
3 | 1110001112222010220221220212 |
4 | 2200201123200232003001 |
5 | 2421213002344220001 |
6 | 35243324315443505 |
7 | 2215651513101101 |
oct | 240413340560301 |
9 | 43045863827825 |
10 | 11031011320001 |
11 | 35732533486a2 |
12 | 12a1a73456595 |
13 | 6202b218a94a |
14 | 2a1c92037201 |
15 | 141e1de9d7bb |
hex | a085b82e0c1 |
11031011320001 has 2 divisors, whose sum is σ = 11031011320002. Its totient is φ = 11031011320000.
The previous prime is 11031011319989. The next prime is 11031011320013. The reversal of 11031011320001 is 10002311013011.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (11031011319989) and next prime (11031011320013).
It can be written as a sum of positive squares in only one way, i.e., 5984990387776 + 5046020932225 = 2446424^2 + 2246335^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11031011320001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11031011320031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515505660000 + 5515505660001.
It is an arithmetic number, because the mean of its divisors is an integer number (5515505660001).
Almost surely, 211031011320001 is an apocalyptic number.
It is an amenable number.
11031011320001 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031011320001 is an equidigital number, since it uses as much as digits as its factorization.
11031011320001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 11031011320001 its reverse (10002311013011), we get a palindrome (21033322333012).
The spelling of 11031011320001 in words is "eleven trillion, thirty-one billion, eleven million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •