Base | Representation |
---|---|
bin | 111101001001011011… |
… | …1011011010010110101 |
3 | 110112221102121200101012 |
4 | 1322102313123102311 |
5 | 4122412113202013 |
6 | 140154021442005 |
7 | 12326026162136 |
oct | 1722267332265 |
9 | 415842550335 |
10 | 131313022133 |
11 | 50764861097 |
12 | 21548570305 |
13 | c4c8c1bac7 |
14 | 64d9a19c8d |
15 | 36382771a8 |
hex | 1e92ddb4b5 |
131313022133 has 6 divisors (see below), whose sum is σ = 131366137014. Its totient is φ = 131259928136.
The previous prime is 131313022121. The next prime is 131313022153. The reversal of 131313022133 is 331220313131.
It can be written as a sum of positive squares in only one way, i.e., 98644990084 + 32668032049 = 314078^2 + 180743^2 .
It is not a de Polignac number, because 131313022133 - 26 = 131313022069 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131313022099 and 131313022108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131313022153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8771891 + ... + 8786847.
It is an arithmetic number, because the mean of its divisors is an integer number (21894356169).
Almost surely, 2131313022133 is an apocalyptic number.
It is an amenable number.
131313022133 is a deficient number, since it is larger than the sum of its proper divisors (53114881).
131313022133 is an frugal number, since it uses more digits than its factorization.
131313022133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20883 (or 17920 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 131313022133 its reverse (331220313131), we get a palindrome (462533335264).
The spelling of 131313022133 in words is "one hundred thirty-one billion, three hundred thirteen million, twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •