Base | Representation |
---|---|
bin | 1010000010000110100010… |
… | …1110110111101000111001 |
3 | 1110001120112121022020022022 |
4 | 2200201220232313220321 |
5 | 2421213431140224423 |
6 | 35243402322004225 |
7 | 2215660145345414 |
oct | 240415056675071 |
9 | 43046477266268 |
10 | 11031233133113 |
11 | 357335757a116 |
12 | 12a1b157a6675 |
13 | 6203191116cb |
14 | 2a1cb3696b7b |
15 | 141e336b5dc8 |
hex | a0868bb7a39 |
11031233133113 has 2 divisors, whose sum is σ = 11031233133114. Its totient is φ = 11031233133112.
The previous prime is 11031233133023. The next prime is 11031233133139. The reversal of 11031233133113 is 31133133213011.
It is an a-pointer prime, because the next prime (11031233133139) can be obtained adding 11031233133113 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10970324373904 + 60908759209 = 3312148^2 + 246797^2 .
It is a cyclic number.
It is not a de Polignac number, because 11031233133113 - 210 = 11031233132089 is a prime.
It is not a weakly prime, because it can be changed into another prime (11031233153113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515616566556 + 5515616566557.
It is an arithmetic number, because the mean of its divisors is an integer number (5515616566557).
Almost surely, 211031233133113 is an apocalyptic number.
It is an amenable number.
11031233133113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031233133113 is an equidigital number, since it uses as much as digits as its factorization.
11031233133113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 11031233133113 its reverse (31133133213011), we get a palindrome (42164366346124).
The spelling of 11031233133113 in words is "eleven trillion, thirty-one billion, two hundred thirty-three million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •