Base | Representation |
---|---|
bin | 111101000110000100… |
… | …1011011111110100101 |
3 | 110112122120111221210222 |
4 | 1322030021123332211 |
5 | 4122144234144023 |
6 | 140134513454125 |
7 | 12323160114023 |
oct | 1721411337645 |
9 | 415576457728 |
10 | 131200303013 |
11 | 5070717259a |
12 | 21516871345 |
13 | c4ab773bc0 |
14 | 64c8a77713 |
15 | 362d40dcc8 |
hex | 1e8c25bfa5 |
131200303013 has 8 divisors (see below), whose sum is σ = 141791905248. Its totient is φ = 120680025264.
The previous prime is 131200302973. The next prime is 131200303021. The reversal of 131200303013 is 310303002131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131200303013 - 216 = 131200237477 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131200302982 and 131200303000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131200303063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17827295 + ... + 17834652.
It is an arithmetic number, because the mean of its divisors is an integer number (17723988156).
Almost surely, 2131200303013 is an apocalyptic number.
131200303013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
131200303013 is a deficient number, since it is larger than the sum of its proper divisors (10591602235).
131200303013 is a wasteful number, since it uses less digits than its factorization.
131200303013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35662243.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 131200303013 its reverse (310303002131), we get a palindrome (441503305144).
The spelling of 131200303013 in words is "one hundred thirty-one billion, two hundred million, three hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •