Base | Representation |
---|---|
bin | 1111101011011… |
… | …01011100111011 |
3 | 100011110220221210 |
4 | 13311231130323 |
5 | 232132122230 |
6 | 21014534203 |
7 | 3154622103 |
oct | 765553473 |
9 | 304426853 |
10 | 131520315 |
11 | 68270183 |
12 | 38067363 |
13 | 2132b794 |
14 | 13678203 |
15 | b82deb0 |
hex | 7d6d73b |
131520315 has 8 divisors (see below), whose sum is σ = 210432528. Its totient is φ = 70144160.
The previous prime is 131520247. The next prime is 131520317. The reversal of 131520315 is 513025131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131520315 - 213 = 131512123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131520291 and 131520300.
It is not an unprimeable number, because it can be changed into a prime (131520317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4383996 + ... + 4384025.
It is an arithmetic number, because the mean of its divisors is an integer number (26304066).
Almost surely, 2131520315 is an apocalyptic number.
131520315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131520315 is a deficient number, since it is larger than the sum of its proper divisors (78912213).
131520315 is an equidigital number, since it uses as much as digits as its factorization.
131520315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8768029.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 131520315 is about 11468.2306830653. The cubic root of 131520315 is about 508.5468244758.
Adding to 131520315 its reverse (513025131), we get a palindrome (644545446).
The spelling of 131520315 in words is "one hundred thirty-one million, five hundred twenty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •