Base | Representation |
---|---|
bin | 10110010001000001010… |
… | …101100110110011111101 |
3 | 12102021110121122020120211 |
4 | 112101001111212303331 |
5 | 200032123230243123 |
6 | 3130530442312421 |
7 | 215355262666651 |
oct | 26210125466375 |
9 | 5367417566524 |
10 | 1530104540413 |
11 | 53aa0613a159 |
12 | 208664ab8711 |
13 | b1399351a27 |
14 | 540b3928a61 |
15 | 29c0527340d |
hex | 16441566cfd |
1530104540413 has 2 divisors, whose sum is σ = 1530104540414. Its totient is φ = 1530104540412.
The previous prime is 1530104540407. The next prime is 1530104540431. The reversal of 1530104540413 is 3140454010351.
Together with next prime (1530104540431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1449526905369 + 80577635044 = 1203963^2 + 283862^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1530104540413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1530104540443) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 765052270206 + 765052270207.
It is an arithmetic number, because the mean of its divisors is an integer number (765052270207).
Almost surely, 21530104540413 is an apocalyptic number.
It is an amenable number.
1530104540413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1530104540413 is an equidigital number, since it uses as much as digits as its factorization.
1530104540413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 1530104540413 its reverse (3140454010351), we get a palindrome (4670558550764).
The spelling of 1530104540413 in words is "one trillion, five hundred thirty billion, one hundred four million, five hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •