Base | Representation |
---|---|
bin | 11100000011100110… |
… | …11011100110010001 |
3 | 1102212202000122122211 |
4 | 32001303123212101 |
5 | 221322014121022 |
6 | 10530352432121 |
7 | 1042160241211 |
oct | 160163334621 |
9 | 42782018584 |
10 | 15062645137 |
11 | 642a51a261 |
12 | 2b04548641 |
13 | 1560810c97 |
14 | a2c690241 |
15 | 5d258ae77 |
hex | 381cdb991 |
15062645137 has 2 divisors, whose sum is σ = 15062645138. Its totient is φ = 15062645136.
The previous prime is 15062645131. The next prime is 15062645141. The reversal of 15062645137 is 73154626051.
15062645137 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7687957761 + 7374687376 = 87681^2 + 85876^2 .
It is a cyclic number.
It is not a de Polignac number, because 15062645137 - 27 = 15062645009 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15062645137.
It is not a weakly prime, because it can be changed into another prime (15062645131) 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 as a sum of consecutive naturals, namely, 7531322568 + 7531322569.
It is an arithmetic number, because the mean of its divisors is an integer number (7531322569).
Almost surely, 215062645137 is an apocalyptic number.
It is an amenable number.
15062645137 is a deficient number, since it is larger than the sum of its proper divisors (1).
15062645137 is an equidigital number, since it uses as much as digits as its factorization.
15062645137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 40.
The spelling of 15062645137 in words is "fifteen billion, sixty-two million, six hundred forty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •