Base | Representation |
---|---|
bin | 11100011011011100… |
… | …110010011010101001 |
3 | 2220210100202000212002 |
4 | 130123130302122221 |
5 | 1000003434134231 |
6 | 22004555100345 |
7 | 2130305534564 |
oct | 343334623251 |
9 | 86710660762 |
10 | 30525302441 |
11 | 11a44812587 |
12 | 5abaa416b5 |
13 | 2b56168c4a |
14 | 16981094db |
15 | bd9cde0cb |
hex | 71b7326a9 |
30525302441 has 2 divisors, whose sum is σ = 30525302442. Its totient is φ = 30525302440.
The previous prime is 30525302429. The next prime is 30525302447. The reversal of 30525302441 is 14420352503.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27482676841 + 3042625600 = 165779^2 + 55160^2 .
It is a cyclic number.
It is not a de Polignac number, because 30525302441 - 230 = 29451560617 is a prime.
It is a super-2 number, since 2×305253024412 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (30525302447) 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, 15262651220 + 15262651221.
It is an arithmetic number, because the mean of its divisors is an integer number (15262651221).
Almost surely, 230525302441 is an apocalyptic number.
It is an amenable number.
30525302441 is a deficient number, since it is larger than the sum of its proper divisors (1).
30525302441 is an equidigital number, since it uses as much as digits as its factorization.
30525302441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14400, while the sum is 29.
Adding to 30525302441 its reverse (14420352503), we get a palindrome (44945654944).
The spelling of 30525302441 in words is "thirty billion, five hundred twenty-five million, three hundred two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •