Base | Representation |
---|---|
bin | 11100011100101000… |
… | …010110010111011101 |
3 | 2220211202000101101122 |
4 | 130130220112113131 |
5 | 1000024022013433 |
6 | 22010543420325 |
7 | 2130636104162 |
oct | 343450262735 |
9 | 86752011348 |
10 | 30545110493 |
11 | 11a54a11677 |
12 | 5b055b46a5 |
13 | 2b5a2b2ba1 |
14 | 169a9c4069 |
15 | bdb903198 |
hex | 71ca165dd |
30545110493 has 2 divisors, whose sum is σ = 30545110494. Its totient is φ = 30545110492.
The previous prime is 30545110441. The next prime is 30545110511. The reversal of 30545110493 is 39401154503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23481884644 + 7063225849 = 153238^2 + 84043^2 .
It is an emirp because it is prime and its reverse (39401154503) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30545110493 - 230 = 29471368669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30545110403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15272555246 + 15272555247.
It is an arithmetic number, because the mean of its divisors is an integer number (15272555247).
Almost surely, 230545110493 is an apocalyptic number.
It is an amenable number.
30545110493 is a deficient number, since it is larger than the sum of its proper divisors (1).
30545110493 is an equidigital number, since it uses as much as digits as its factorization.
30545110493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 30545110493 its reverse (39401154503), we get a palindrome (69946264996).
The spelling of 30545110493 in words is "thirty billion, five hundred forty-five million, one hundred ten thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •