Base | Representation |
---|---|
bin | 11101110010011110101000… |
… | …111010101111101110011101 |
3 | 122011212122102222011021001212 |
4 | 131302132220322233232131 |
5 | 114133001012134331023 |
6 | 1142350103355314205 |
7 | 36411214656520250 |
oct | 3562365072575635 |
9 | 564778388137055 |
10 | 131012221402013 |
11 | 38820a75555366 |
12 | 1283b067a4b965 |
13 | 5814526824143 |
14 | 244d04d7b7097 |
15 | 1022dddc15e78 |
hex | 7727a8eafb9d |
131012221402013 has 16 divisors (see below), whose sum is σ = 150131172182400. Its totient is φ = 111994231910400.
The previous prime is 131012221401973. The next prime is 131012221402079. The reversal of 131012221402013 is 310204122210131.
It is not a de Polignac number, because 131012221402013 - 26 = 131012221401949 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131012221402013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131012221401013) 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, 2852543 + ... + 16436588.
It is an arithmetic number, because the mean of its divisors is an integer number (9383198261400).
Almost surely, 2131012221402013 is an apocalyptic number.
It is an amenable number.
131012221402013 is a deficient number, since it is larger than the sum of its proper divisors (19118950780387).
131012221402013 is a wasteful number, since it uses less digits than its factorization.
131012221402013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19291748.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 131012221402013 its reverse (310204122210131), we get a palindrome (441216343612144).
The spelling of 131012221402013 in words is "one hundred thirty-one trillion, twelve billion, two hundred twenty-one million, four hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •