Base | Representation |
---|---|
bin | 1011111100011001010011… |
… | …0010100111100100101011 |
3 | 1201111102112101102112012221 |
4 | 2333012110302213210223 |
5 | 3210124232044234011 |
6 | 43532504332014511 |
7 | 2523525303316210 |
oct | 277062462474453 |
9 | 51442471375187 |
10 | 13132211321131 |
11 | 4203380a31151 |
12 | 158113b001437 |
13 | 743492a26596 |
14 | 335861077b07 |
15 | 17b8eb701971 |
hex | bf194ca792b |
13132211321131 has 16 divisors (see below), whose sum is σ = 15036570943488. Its totient is φ = 11234953980000.
The previous prime is 13132211321071. The next prime is 13132211321161. The reversal of 13132211321131 is 13112311223131.
It is a cyclic number.
It is not a de Polignac number, because 13132211321131 - 219 = 13132210796843 is a prime.
It is a super-2 number, since 2×131322113211312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13132211321096 and 13132211321105.
It is not an unprimeable number, because it can be changed into a prime (13132211321161) 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, 7090981 + ... + 8749081.
It is an arithmetic number, because the mean of its divisors is an integer number (939785683968).
Almost surely, 213132211321131 is an apocalyptic number.
13132211321131 is a deficient number, since it is larger than the sum of its proper divisors (1904359622357).
13132211321131 is a wasteful number, since it uses less digits than its factorization.
13132211321131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1660242.
The product of its digits is 648, while the sum is 25.
Adding to 13132211321131 its reverse (13112311223131), we get a palindrome (26244522544262).
The spelling of 13132211321131 in words is "thirteen trillion, one hundred thirty-two billion, two hundred eleven million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •