Base | Representation |
---|---|
bin | 111101001001000101… |
… | …1100011000001100101 |
3 | 110112220121222021200022 |
4 | 1322102023203001211 |
5 | 4122401142110321 |
6 | 140152531124525 |
7 | 12325526333510 |
oct | 1722213430145 |
9 | 415817867608 |
10 | 131301519461 |
11 | 50759314a52 |
12 | 21544743745 |
13 | c4c67222a8 |
14 | 64d82a3d77 |
15 | 3637253dab |
hex | 1e922e3065 |
131301519461 has 4 divisors (see below), whose sum is σ = 150058879392. Its totient is φ = 112544159532.
The previous prime is 131301519451. The next prime is 131301519469. The reversal of 131301519461 is 164915103131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 164915103131 = 256219 ⋅643649.
It is not a de Polignac number, because 131301519461 - 210 = 131301518437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131301519469) 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 3 ways as a sum of consecutive naturals, for example, 9378679955 + ... + 9378679968.
It is an arithmetic number, because the mean of its divisors is an integer number (37514719848).
Almost surely, 2131301519461 is an apocalyptic number.
It is an amenable number.
131301519461 is a deficient number, since it is larger than the sum of its proper divisors (18757359931).
131301519461 is an equidigital number, since it uses as much as digits as its factorization.
131301519461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18757359930.
The product of its (nonzero) digits is 9720, while the sum is 35.
The spelling of 131301519461 in words is "one hundred thirty-one billion, three hundred one million, five hundred nineteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •