Base | Representation |
---|---|
bin | 1010000010000101101101… |
… | …1100000111011001101101 |
3 | 1110001112222001122122102001 |
4 | 2200201123130013121231 |
5 | 2421213002042110013 |
6 | 35243324233532301 |
7 | 2215651466613403 |
oct | 240413334073155 |
9 | 43045861578361 |
10 | 11031010113133 |
11 | 35732526a398a |
12 | 12a1a72b74091 |
13 | 6202b1b5751a |
14 | 2a1c91c01473 |
15 | 141e1dd10ddd |
hex | a085b70766d |
11031010113133 has 2 divisors, whose sum is σ = 11031010113134. Its totient is φ = 11031010113132.
The previous prime is 11031010113107. The next prime is 11031010113163. The reversal of 11031010113133 is 33131101013011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10674060025924 + 356950087209 = 3267118^2 + 597453^2 .
It is a cyclic number.
It is not a de Polignac number, because 11031010113133 - 233 = 11022420178541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11031010113133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031010113163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515505056566 + 5515505056567.
It is an arithmetic number, because the mean of its divisors is an integer number (5515505056567).
Almost surely, 211031010113133 is an apocalyptic number.
It is an amenable number.
11031010113133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031010113133 is an equidigital number, since it uses as much as digits as its factorization.
11031010113133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 19.
Adding to 11031010113133 its reverse (33131101013011), we get a palindrome (44162111126144).
The spelling of 11031010113133 in words is "eleven trillion, thirty-one billion, ten million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •