Base | Representation |
---|---|
bin | 11100001011110000… |
… | …11000100111101001 |
3 | 1110001111202002221122 |
4 | 32011320120213221 |
5 | 221442022140041 |
6 | 10541234545025 |
7 | 1043650552514 |
oct | 160570304751 |
9 | 43044662848 |
10 | 15131052521 |
11 | 64650a2792 |
12 | 2b23438175 |
13 | 1571a42920 |
14 | a377b9d7b |
15 | 5d859ec4b |
hex | 385e189e9 |
15131052521 has 16 divisors (see below), whose sum is σ = 17579059344. Its totient is φ = 12897490944.
The previous prime is 15131052493. The next prime is 15131052529. The reversal of 15131052521 is 12525013151.
15131052521 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 548074921 + 14582977600 = 23411^2 + 120760^2 .
It is not a de Polignac number, because 15131052521 - 222 = 15126858217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (15131052529) 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 15 ways as a sum of consecutive naturals, for example, 634196 + ... + 657621.
It is an arithmetic number, because the mean of its divisors is an integer number (1098691209).
Almost surely, 215131052521 is an apocalyptic number.
It is an amenable number.
15131052521 is a deficient number, since it is larger than the sum of its proper divisors (2448006823).
15131052521 is a wasteful number, since it uses less digits than its factorization.
15131052521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1291900.
The product of its (nonzero) digits is 1500, while the sum is 26.
Adding to 15131052521 its reverse (12525013151), we get a palindrome (27656065672).
The spelling of 15131052521 in words is "fifteen billion, one hundred thirty-one million, fifty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •