Base | Representation |
---|---|
bin | 1101101010000011010101… |
… | …01100001110010000001001 |
3 | 10221100001100202010212012012 |
4 | 12311001222230032100021 |
5 | 12414021422013424431 |
6 | 143512334113025305 |
7 | 6216516642125123 |
oct | 665015254162011 |
9 | 127301322125165 |
10 | 30032201311241 |
11 | 962964877a878 |
12 | 3450537555235 |
13 | 139b0418a477c |
14 | 75b7cdcd4213 |
15 | 371316ccd22b |
hex | 1b506ab0e409 |
30032201311241 has 2 divisors, whose sum is σ = 30032201311242. Its totient is φ = 30032201311240.
The previous prime is 30032201311207. The next prime is 30032201311249. The reversal of 30032201311241 is 14211310223003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28101502177225 + 1930699134016 = 5301085^2 + 1389496^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30032201311241 is a prime.
It is not a weakly prime, because it can be changed into another prime (30032201311249) 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, 15016100655620 + 15016100655621.
It is an arithmetic number, because the mean of its divisors is an integer number (15016100655621).
Almost surely, 230032201311241 is an apocalyptic number.
It is an amenable number.
30032201311241 is a deficient number, since it is larger than the sum of its proper divisors (1).
30032201311241 is an equidigital number, since it uses as much as digits as its factorization.
30032201311241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 30032201311241 its reverse (14211310223003), we get a palindrome (44243511534244).
The spelling of 30032201311241 in words is "thirty trillion, thirty-two billion, two hundred one million, three hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •