Base | Representation |
---|---|
bin | 101101100110010… |
… | …0000011100110101 |
3 | 10221121222022201000 |
4 | 1123030200130311 |
5 | 11113140132201 |
6 | 411453153513 |
7 | 52625554566 |
oct | 13314403465 |
9 | 3847868630 |
10 | 1530005301 |
11 | 7157146a0 |
12 | 36848b899 |
13 | 1b4c997a6 |
14 | 1072b416d |
15 | 8e4c4d86 |
hex | 5b320735 |
1530005301 has 16 divisors (see below), whose sum is σ = 2472736320. Its totient is φ = 927275760.
The previous prime is 1530005299. The next prime is 1530005303. The reversal of 1530005301 is 1035000351.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1530005299) and next prime (1530005303).
It is not a de Polignac number, because 1530005301 - 21 = 1530005299 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1530005303) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2575470 + ... + 2576063.
It is an arithmetic number, because the mean of its divisors is an integer number (154546020).
Almost surely, 21530005301 is an apocalyptic number.
1530005301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1530005301 is a deficient number, since it is larger than the sum of its proper divisors (942731019).
1530005301 is a wasteful number, since it uses less digits than its factorization.
1530005301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5151553 (or 5151547 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 18.
The square root of 1530005301 is about 39115.2821925140. The cubic root of 1530005301 is about 1152.2966832977.
Adding to 1530005301 its reverse (1035000351), we get a palindrome (2565005652).
The spelling of 1530005301 in words is "one billion, five hundred thirty million, five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •