Base | Representation |
---|---|
bin | 10111011011000000110001… |
… | …001101000000110101010011 |
3 | 111111201210020002021101201111 |
4 | 113123000301031000311103 |
5 | 102000214141201402011 |
6 | 1003030425253114151 |
7 | 30461215365303322 |
oct | 2733006115006523 |
9 | 444653202241644 |
10 | 103011321122131 |
11 | 2a905946301534 |
12 | b67834b028957 |
13 | 4562c06285386 |
14 | 1b61abb4ca0b9 |
15 | bd9862d85121 |
hex | 5db031340d53 |
103011321122131 has 2 divisors, whose sum is σ = 103011321122132. Its totient is φ = 103011321122130.
The previous prime is 103011321122123. The next prime is 103011321122153. The reversal of 103011321122131 is 131221123110301.
It is an a-pointer prime, because the next prime (103011321122153) can be obtained adding 103011321122131 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103011321122131 - 23 = 103011321122123 is a prime.
It is a super-2 number, since 2×1030113211221312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103011321122231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505660561065 + 51505660561066.
It is an arithmetic number, because the mean of its divisors is an integer number (51505660561066).
Almost surely, 2103011321122131 is an apocalyptic number.
103011321122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
103011321122131 is an equidigital number, since it uses as much as digits as its factorization.
103011321122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 103011321122131 its reverse (131221123110301), we get a palindrome (234232444232432).
The spelling of 103011321122131 in words is "one hundred three trillion, eleven billion, three hundred twenty-one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •