Base | Representation |
---|---|
bin | 10110010001000001010… |
… | …001000100110011100001 |
3 | 12102021110112101220010201 |
4 | 112101001101010303201 |
5 | 200032122424240140 |
6 | 3130530401025201 |
7 | 215355246621535 |
oct | 26210121046341 |
9 | 5367415356121 |
10 | 1530103352545 |
11 | 53aa054a8749 |
12 | 208664625201 |
13 | b1399027151 |
14 | 540b36d9bc5 |
15 | 29c050db49a |
hex | 16441444ce1 |
1530103352545 has 4 divisors (see below), whose sum is σ = 1836124023060. Its totient is φ = 1224082682032.
The previous prime is 1530103352539. The next prime is 1530103352549. The reversal of 1530103352545 is 5452533010351.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 859877871616 + 670225480929 = 927296^2 + 818673^2 .
It is a cyclic number.
It is not a de Polignac number, because 1530103352545 - 213 = 1530103344353 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1530103352549) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 153010335250 + ... + 153010335259.
It is an arithmetic number, because the mean of its divisors is an integer number (459031005765).
Almost surely, 21530103352545 is an apocalyptic number.
It is an amenable number.
1530103352545 is a deficient number, since it is larger than the sum of its proper divisors (306020670515).
1530103352545 is an equidigital number, since it uses as much as digits as its factorization.
1530103352545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306020670514.
The product of its (nonzero) digits is 135000, while the sum is 37.
Adding to 1530103352545 its reverse (5452533010351), we get a palindrome (6982636362896).
The spelling of 1530103352545 in words is "one trillion, five hundred thirty billion, one hundred three million, three hundred fifty-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •