Base | Representation |
---|---|
bin | 10111011011000000110000… |
… | …101010101110010000001101 |
3 | 111111201210012110100201010122 |
4 | 113123000300222232100031 |
5 | 102000214131401230013 |
6 | 1003030424332314325 |
7 | 30461215226014325 |
oct | 2733006052562015 |
9 | 444653173321118 |
10 | 103011312133133 |
11 | 2a905941221a08 |
12 | b6783480129a5 |
13 | 4562c04458a41 |
14 | 1b61aba22a285 |
15 | bd98621aba08 |
hex | 5db030aae40d |
103011312133133 has 16 divisors (see below), whose sum is σ = 108751694856000. Its totient is φ = 97302844235520.
The previous prime is 103011312133129. The next prime is 103011312133151. The reversal of 103011312133133 is 331331213110301.
It is a cyclic number.
It is not a de Polignac number, because 103011312133133 - 22 = 103011312133129 is a prime.
It is a super-2 number, since 2×1030113121331332 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011312133193) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90217685 + ... + 91352357.
It is an arithmetic number, because the mean of its divisors is an integer number (6796980928500).
Almost surely, 2103011312133133 is an apocalyptic number.
It is an amenable number.
103011312133133 is a deficient number, since it is larger than the sum of its proper divisors (5740382722867).
103011312133133 is a wasteful number, since it uses less digits than its factorization.
103011312133133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1148732.
The product of its (nonzero) digits is 1458, while the sum is 26.
Adding to 103011312133133 its reverse (331331213110301), we get a palindrome (434342525243434).
The spelling of 103011312133133 in words is "one hundred three trillion, eleven billion, three hundred twelve million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •