Base | Representation |
---|---|
bin | 111101000110000100… |
… | …0010010101111000101 |
3 | 110112122112221201021212 |
4 | 1322030020102233011 |
5 | 4122144200044023 |
6 | 140134503221205 |
7 | 12323154424262 |
oct | 1721410225705 |
9 | 415575851255 |
10 | 131200003013 |
11 | 50706a88162 |
12 | 21516747805 |
13 | c4ab69a4a1 |
14 | 64c89da269 |
15 | 362d39ee78 |
hex | 1e8c212bc5 |
131200003013 has 8 divisors (see below), whose sum is σ = 132068686080. Its totient is φ = 130331738160.
The previous prime is 131200002979. The next prime is 131200003019. The reversal of 131200003013 is 310300002131.
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 131200003013 - 214 = 131199986629 is a prime.
It is a super-2 number, since 2×1312000030132 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131200003019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 537968 + ... + 742838.
It is an arithmetic number, because the mean of its divisors is an integer number (16508585760).
Almost surely, 2131200003013 is an apocalyptic number.
It is an amenable number.
131200003013 is a deficient number, since it is larger than the sum of its proper divisors (868683067).
131200003013 is a wasteful number, since it uses less digits than its factorization.
131200003013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209107.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 131200003013 its reverse (310300002131), we get a palindrome (441500005144).
The spelling of 131200003013 in words is "one hundred thirty-one billion, two hundred million, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •