Base | Representation |
---|---|
bin | 1111101100000… |
… | …01111111100011 |
3 | 100011122012100221 |
4 | 13312001333203 |
5 | 232142320301 |
6 | 21020423511 |
7 | 3155422306 |
oct | 766017743 |
9 | 304565327 |
10 | 131604451 |
11 | 68318410 |
12 | 380a7b97 |
13 | 2135ab74 |
14 | 1369ab3d |
15 | b848da1 |
hex | 7d81fe3 |
131604451 has 4 divisors (see below), whose sum is σ = 143568504. Its totient is φ = 119640400.
The previous prime is 131604443. The next prime is 131604457. The reversal of 131604451 is 154406131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 154406131 = 11 ⋅14036921.
It is not a de Polignac number, because 131604451 - 23 = 131604443 is a prime.
It is a super-2 number, since 2×1316044512 = 34639463046022802, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131604457) 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, 5982010 + ... + 5982031.
It is an arithmetic number, because the mean of its divisors is an integer number (35892126).
Almost surely, 2131604451 is an apocalyptic number.
131604451 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131604451 is a deficient number, since it is larger than the sum of its proper divisors (11964053).
131604451 is a wasteful number, since it uses less digits than its factorization.
131604451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11964052.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 131604451 is about 11471.8983171923. The cubic root of 131604451 is about 508.6552436580.
The spelling of 131604451 in words is "one hundred thirty-one million, six hundred four thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •