Base | Representation |
---|---|
bin | 1101110001010001011101… |
… | …1100110101011001110001 |
3 | 1222121101101022020020121011 |
4 | 3130110113130311121301 |
5 | 3441024013201400022 |
6 | 52111142414030521 |
7 | 3121561052300365 |
oct | 334242734653161 |
9 | 58541338206534 |
10 | 15140153153137 |
11 | 49079a282a961 |
12 | 184631a7a8441 |
13 | 85a93074591c |
14 | 3a4b045ad2a5 |
15 | 1b3c6ba39977 |
hex | dc517735671 |
15140153153137 has 2 divisors, whose sum is σ = 15140153153138. Its totient is φ = 15140153153136.
The previous prime is 15140153153129. The next prime is 15140153153239. The reversal of 15140153153137 is 73135135104151.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14338915128976 + 801238024161 = 3786676^2 + 895119^2 .
It is a cyclic number.
It is not a de Polignac number, because 15140153153137 - 23 = 15140153153129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 15140153153137.
It is not a weakly prime, because it can be changed into another prime (15140153153737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7570076576568 + 7570076576569.
It is an arithmetic number, because the mean of its divisors is an integer number (7570076576569).
Almost surely, 215140153153137 is an apocalyptic number.
It is an amenable number.
15140153153137 is a deficient number, since it is larger than the sum of its proper divisors (1).
15140153153137 is an equidigital number, since it uses as much as digits as its factorization.
15140153153137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 94500, while the sum is 40.
Adding to 15140153153137 its reverse (73135135104151), we get a palindrome (88275288257288).
The spelling of 15140153153137 in words is "fifteen trillion, one hundred forty billion, one hundred fifty-three million, one hundred fifty-three thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •