Base | Representation |
---|---|
bin | 1010000010001010100011… |
… | …1111110010101010111001 |
3 | 1110001200022202002100100212 |
4 | 2200202220333302222321 |
5 | 2421223133143423113 |
6 | 35244101315040505 |
7 | 2216025646613315 |
oct | 240425077625271 |
9 | 43050282070325 |
10 | 11032311311033 |
11 | 357386013a151 |
12 | 12a21768a0135 |
13 | 62045b5c17cc |
14 | 2a1d76954b45 |
15 | 141e9818b0a8 |
hex | a08a8ff2ab9 |
11032311311033 has 2 divisors, whose sum is σ = 11032311311034. Its totient is φ = 11032311311032.
The previous prime is 11032311310981. The next prime is 11032311311173. The reversal of 11032311311033 is 33011311323011.
11032311311033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10865910137104 + 166401173929 = 3296348^2 + 407923^2 .
It is a cyclic number.
It is not a de Polignac number, because 11032311311033 - 232 = 11028016343737 is a prime.
It is not a weakly prime, because it can be changed into another prime (11032311311533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516155655516 + 5516155655517.
It is an arithmetic number, because the mean of its divisors is an integer number (5516155655517).
Almost surely, 211032311311033 is an apocalyptic number.
It is an amenable number.
11032311311033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11032311311033 is an equidigital number, since it uses as much as digits as its factorization.
11032311311033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11032311311033 its reverse (33011311323011), we get a palindrome (44043622634044).
The spelling of 11032311311033 in words is "eleven trillion, thirty-two billion, three hundred eleven million, three hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •