Base | Representation |
---|---|
bin | 10110010001100100101… |
… | …011111011101000010101 |
3 | 12102022222221120120002211 |
4 | 112101210223323220111 |
5 | 200034332041023123 |
6 | 3131105345433421 |
7 | 215406053612200 |
oct | 26214453735025 |
9 | 5368887516084 |
10 | 1530697595413 |
11 | 54018a984158 |
12 | 2087ab63b871 |
13 | b146218844c |
14 | 5412c5c4937 |
15 | 29c3c36d40d |
hex | 16464afba15 |
1530697595413 has 24 divisors (see below), whose sum is σ = 1837351323864. Its totient is φ = 1270682380800.
The previous prime is 1530697595407. The next prime is 1530697595447. The reversal of 1530697595413 is 3145957960351.
It can be written as a sum of positive squares in 4 ways, for example, as 23359454244 + 1507338141169 = 152838^2 + 1227737^2 .
It is a de Polignac number, because none of the positive numbers 2k-1530697595413 is a prime.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1530697598413) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2505498 + ... + 3055963.
It is an arithmetic number, because the mean of its divisors is an integer number (76556305161).
Almost surely, 21530697595413 is an apocalyptic number.
It is an amenable number.
1530697595413 is a deficient number, since it is larger than the sum of its proper divisors (306653728451).
1530697595413 is a wasteful number, since it uses less digits than its factorization.
1530697595413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5561653 (or 5561646 counting only the distinct ones).
The product of its (nonzero) digits is 15309000, while the sum is 58.
The spelling of 1530697595413 in words is "one trillion, five hundred thirty billion, six hundred ninety-seven million, five hundred ninety-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •