Base | Representation |
---|---|
bin | 111101001111100110… |
… | …1111100101000011101 |
3 | 110120110212120001220221 |
4 | 1322133031330220131 |
5 | 4123323141034240 |
6 | 140230343241341 |
7 | 12334123462141 |
oct | 1723715745035 |
9 | 416425501827 |
10 | 131520252445 |
11 | 5086083230a |
12 | 215a5a49251 |
13 | c52cb380aa |
14 | 6519361221 |
15 | 364b55da4a |
hex | 1e9f37ca1d |
131520252445 has 8 divisors (see below), whose sum is σ = 158236379136. Its totient is φ = 104941484496.
The previous prime is 131520252401. The next prime is 131520252467. The reversal of 131520252445 is 544252025131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131520252445 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131520252445.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34337577 + ... + 34341406.
It is an arithmetic number, because the mean of its divisors is an integer number (19779547392).
Almost surely, 2131520252445 is an apocalyptic number.
It is an amenable number.
131520252445 is a deficient number, since it is larger than the sum of its proper divisors (26716126691).
131520252445 is an equidigital number, since it uses as much as digits as its factorization.
131520252445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68679371.
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 131520252445 its reverse (544252025131), we get a palindrome (675772277576).
The spelling of 131520252445 in words is "one hundred thirty-one billion, five hundred twenty million, two hundred fifty-two thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •