Base | Representation |
---|---|
bin | 1101111001000100000110… |
… | …10110011100111010100101 |
3 | 11000011100202102021120020212 |
4 | 12330202003112130322211 |
5 | 13000444311321010203 |
6 | 144545321303105205 |
7 | 6302010123101423 |
oct | 674420326347245 |
9 | 130140672246225 |
10 | 30548011110053 |
11 | 980837a9830a8 |
12 | 35144ab142205 |
13 | 1407885272588 |
14 | 778762ad8113 |
15 | 37e9558861d8 |
hex | 1bc88359cea5 |
30548011110053 has 2 divisors, whose sum is σ = 30548011110054. Its totient is φ = 30548011110052.
The previous prime is 30548011110007. The next prime is 30548011110073. The reversal of 30548011110053 is 35001111084503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21533887573444 + 9014123536609 = 4640462^2 + 3002353^2 .
It is a cyclic number.
It is not a de Polignac number, because 30548011110053 - 218 = 30548010847909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30548011110073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15274005555026 + 15274005555027.
It is an arithmetic number, because the mean of its divisors is an integer number (15274005555027).
Almost surely, 230548011110053 is an apocalyptic number.
It is an amenable number.
30548011110053 is a deficient number, since it is larger than the sum of its proper divisors (1).
30548011110053 is an equidigital number, since it uses as much as digits as its factorization.
30548011110053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 32.
Adding to 30548011110053 its reverse (35001111084503), we get a palindrome (65549122194556).
The spelling of 30548011110053 in words is "thirty trillion, five hundred forty-eight billion, eleven million, one hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •