Base | Representation |
---|---|
bin | 11101111000011011110100… |
… | …101110000101100010010101 |
3 | 122020022202220100100121112200 |
4 | 131320123310232011202111 |
5 | 114211202230322420023 |
6 | 1143302113250435113 |
7 | 36452614441214334 |
oct | 3570336456054225 |
9 | 566282810317480 |
10 | 131421515045013 |
11 | 38969608100256 |
12 | 128a6453592a99 |
13 | 5843cc36c5c0b |
14 | 2464b99d8bd1b |
15 | 102d896491743 |
hex | 7786f4b85895 |
131421515045013 has 48 divisors (see below), whose sum is σ = 201567375434880. Its totient is φ = 82227053472768.
The previous prime is 131421515044993. The next prime is 131421515045021. The reversal of 131421515045013 is 310540515124131.
131421515045013 is a `hidden beast` number, since 1 + 3 + 1 + 4 + 2 + 151 + 50 + 450 + 1 + 3 = 666.
It is not a de Polignac number, because 131421515045013 - 230 = 131420441303189 is a prime.
It is a super-2 number, since 2×1314215150450132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131421515045083) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 102754033 + ... + 104025161.
It is an arithmetic number, because the mean of its divisors is an integer number (4199320321560).
Almost surely, 2131421515045013 is an apocalyptic number.
It is an amenable number.
131421515045013 is a deficient number, since it is larger than the sum of its proper divisors (70145860389867).
131421515045013 is a wasteful number, since it uses less digits than its factorization.
131421515045013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1273066 (or 1273063 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The spelling of 131421515045013 in words is "one hundred thirty-one trillion, four hundred twenty-one billion, five hundred fifteen million, forty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •