Base | Representation |
---|---|
bin | 1101110111001110110110… |
… | …1101111101100101011001 |
3 | 1222222011122021111110100222 |
4 | 3131303231231331211121 |
5 | 3444213201221341004 |
6 | 52230153404405425 |
7 | 3132144105045602 |
oct | 335635555754531 |
9 | 58864567443328 |
10 | 15242532215129 |
11 | 494735a07749a |
12 | 1862131246875 |
13 | 8674980bc94b |
14 | 3a9a5759cda9 |
15 | 1b675ea617be |
hex | ddcedb7d959 |
15242532215129 has 2 divisors, whose sum is σ = 15242532215130. Its totient is φ = 15242532215128.
The previous prime is 15242532215093. The next prime is 15242532215171. The reversal of 15242532215129 is 92151223524251.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12209797039504 + 3032735175625 = 3494252^2 + 1741475^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15242532215129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15242532215129.
It is not a weakly prime, because it can be changed into another prime (15242532215329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7621266107564 + 7621266107565.
It is an arithmetic number, because the mean of its divisors is an integer number (7621266107565).
Almost surely, 215242532215129 is an apocalyptic number.
It is an amenable number.
15242532215129 is a deficient number, since it is larger than the sum of its proper divisors (1).
15242532215129 is an equidigital number, since it uses as much as digits as its factorization.
15242532215129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432000, while the sum is 44.
The spelling of 15242532215129 in words is "fifteen trillion, two hundred forty-two billion, five hundred thirty-two million, two hundred fifteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •