Base | Representation |
---|---|
bin | 11100111011011101… |
… | …11111001011011001 |
3 | 1111002101202211222122 |
4 | 32131232333023121 |
5 | 223301444222301 |
6 | 11045052231025 |
7 | 1056610244336 |
oct | 163556771331 |
9 | 44071684878 |
10 | 15531242201 |
11 | 664aa88162 |
12 | 301546b475 |
13 | 160691c657 |
14 | a749cd98d |
15 | 60d79e81b |
hex | 39dbbf2d9 |
15531242201 has 2 divisors, whose sum is σ = 15531242202. Its totient is φ = 15531242200.
The previous prime is 15531242191. The next prime is 15531242273. The reversal of 15531242201 is 10224213551.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13936038601 + 1595203600 = 118051^2 + 39940^2 .
It is an emirp because it is prime and its reverse (10224213551) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 15531242201 - 210 = 15531241177 is a prime.
It is a super-2 number, since 2×155312422012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (15531242281) by changing a digit.
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 as a sum of consecutive naturals, namely, 7765621100 + 7765621101.
It is an arithmetic number, because the mean of its divisors is an integer number (7765621101).
Almost surely, 215531242201 is an apocalyptic number.
It is an amenable number.
15531242201 is a deficient number, since it is larger than the sum of its proper divisors (1).
15531242201 is an equidigital number, since it uses as much as digits as its factorization.
15531242201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 15531242201 its reverse (10224213551), we get a palindrome (25755455752).
The spelling of 15531242201 in words is "fifteen billion, five hundred thirty-one million, two hundred forty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •