Base | Representation |
---|---|
bin | 11101110101010111110111… |
… | …110010110100100000100101 |
3 | 122012120122211002012110210221 |
4 | 131311113313302310200211 |
5 | 114144230324441021013 |
6 | 1143021315301244341 |
7 | 36431455463213302 |
oct | 3565276762644045 |
9 | 565518732173727 |
10 | 131211113220133 |
11 | 38898358823071 |
12 | 128717144036b1 |
13 | 582a20238949b |
14 | 245891a62a0a9 |
15 | 102817ec3a08d |
hex | 7755f7cb4825 |
131211113220133 has 16 divisors (see below), whose sum is σ = 137640108128256. Its totient is φ = 124842535269760.
The previous prime is 131211113220053. The next prime is 131211113220181. The reversal of 131211113220133 is 331022311112131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131211113220133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131211113220098 and 131211113220107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211113220193) 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, 82738641 + ... + 84309577.
It is an arithmetic number, because the mean of its divisors is an integer number (8602506758016).
Almost surely, 2131211113220133 is an apocalyptic number.
It is an amenable number.
131211113220133 is a deficient number, since it is larger than the sum of its proper divisors (6428994908123).
131211113220133 is a wasteful number, since it uses less digits than its factorization.
131211113220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590164.
The product of its (nonzero) digits is 648, while the sum is 25.
Adding to 131211113220133 its reverse (331022311112131), we get a palindrome (462233424332264).
The spelling of 131211113220133 in words is "one hundred thirty-one trillion, two hundred eleven billion, one hundred thirteen million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •