Base | Representation |
---|---|
bin | 11100001010100000… |
… | …01100000000111011 |
3 | 1110000202220202100221 |
4 | 32011100030000323 |
5 | 221431322441011 |
6 | 10540221040511 |
7 | 1043462154331 |
oct | 160520140073 |
9 | 43022822327 |
10 | 15120515131 |
11 | 645a1558a7 |
12 | 2b1b9b6137 |
13 | 156c7c3597 |
14 | a36235b51 |
15 | 5d76bc971 |
hex | 38540c03b |
15120515131 has 2 divisors, whose sum is σ = 15120515132. Its totient is φ = 15120515130.
The previous prime is 15120515107. The next prime is 15120515147. The reversal of 15120515131 is 13151502151.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-15120515131 is a prime.
It is a super-2 number, since 2×151205151312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 15120515096 and 15120515105.
It is not a weakly prime, because it can be changed into another prime (15120515101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7560257565 + 7560257566.
It is an arithmetic number, because the mean of its divisors is an integer number (7560257566).
Almost surely, 215120515131 is an apocalyptic number.
15120515131 is a deficient number, since it is larger than the sum of its proper divisors (1).
15120515131 is an equidigital number, since it uses as much as digits as its factorization.
15120515131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 15120515131 in words is "fifteen billion, one hundred twenty million, five hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •