Base | Representation |
---|---|
bin | 1101111001001101110011… |
… | …11000110101110110110111 |
3 | 11000011212012111201112211201 |
4 | 12330212321320311312313 |
5 | 13001040444042441241 |
6 | 144551542254313331 |
7 | 6302253205003051 |
oct | 674467170656667 |
9 | 130155174645751 |
10 | 30553221062071 |
11 | 980a603850174 |
12 | 3515503ab8847 |
13 | 1408205761216 |
14 | 778ad8a0c8d1 |
15 | 37eb5ce60931 |
hex | 1bc9b9e35db7 |
30553221062071 has 2 divisors, whose sum is σ = 30553221062072. Its totient is φ = 30553221062070.
The previous prime is 30553221062009. The next prime is 30553221062081. The reversal of 30553221062071 is 17026012235503.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30553221062071 - 231 = 30551073578423 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30553221062071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30553221062081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15276610531035 + 15276610531036.
It is an arithmetic number, because the mean of its divisors is an integer number (15276610531036).
Almost surely, 230553221062071 is an apocalyptic number.
30553221062071 is a deficient number, since it is larger than the sum of its proper divisors (1).
30553221062071 is an equidigital number, since it uses as much as digits as its factorization.
30553221062071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 37.
Adding to 30553221062071 its reverse (17026012235503), we get a palindrome (47579233297574).
The spelling of 30553221062071 in words is "thirty trillion, five hundred fifty-three billion, two hundred twenty-one million, sixty-two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •