Base | Representation |
---|---|
bin | 101010101000111… |
… | …0010111100110101 |
3 | 10200201011112112111 |
4 | 1111101302330311 |
5 | 10412231303001 |
6 | 353545251021 |
7 | 50311664056 |
oct | 12521627465 |
9 | 3621145474 |
10 | 1430728501 |
11 | 674677554 |
12 | 33b193a71 |
13 | 19a54a217 |
14 | d803072d |
15 | 85914851 |
hex | 55472f35 |
1430728501 has 4 divisors (see below), whose sum is σ = 1492934112. Its totient is φ = 1368522892.
The previous prime is 1430728499. The next prime is 1430728513. The reversal of 1430728501 is 1058270341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1430728501 - 21 = 1430728499 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430728571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31102771 + ... + 31102816.
It is an arithmetic number, because the mean of its divisors is an integer number (373233528).
Almost surely, 21430728501 is an apocalyptic number.
It is an amenable number.
1430728501 is a deficient number, since it is larger than the sum of its proper divisors (62205611).
1430728501 is an equidigital number, since it uses as much as digits as its factorization.
1430728501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62205610.
The product of its (nonzero) digits is 6720, while the sum is 31.
The square root of 1430728501 is about 37824.9719233207. The cubic root of 1430728501 is about 1126.8144549645.
Adding to 1430728501 its reverse (1058270341), we get a palindrome (2488998842).
The spelling of 1430728501 in words is "one billion, four hundred thirty million, seven hundred twenty-eight thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •