Base | Representation |
---|---|
bin | 1101111001001010011101… |
… | …00011111000011001001001 |
3 | 11000011200120000110201010222 |
4 | 12330211032203320121021 |
5 | 13001023302110432241 |
6 | 144551043452115425 |
7 | 6302160451451654 |
oct | 674451643703111 |
9 | 130150500421128 |
10 | 30551420405321 |
11 | 980986a3880a2 |
12 | 35150a0a65b75 |
13 | 1407ca96a125a |
14 | 7789a780489b |
15 | 37eaa4d27a4b |
hex | 1bc94e8f8649 |
30551420405321 has 2 divisors, whose sum is σ = 30551420405322. Its totient is φ = 30551420405320.
The previous prime is 30551420405309. The next prime is 30551420405347. The reversal of 30551420405321 is 12350402415503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29828954404921 + 722466000400 = 5461589^2 + 849980^2 .
It is a cyclic number.
It is not a de Polignac number, because 30551420405321 - 26 = 30551420405257 is a prime.
It is a super-2 number, since 2×305514204053212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30551420405351) 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, 15275710202660 + 15275710202661.
It is an arithmetic number, because the mean of its divisors is an integer number (15275710202661).
Almost surely, 230551420405321 is an apocalyptic number.
It is an amenable number.
30551420405321 is a deficient number, since it is larger than the sum of its proper divisors (1).
30551420405321 is an equidigital number, since it uses as much as digits as its factorization.
30551420405321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 35.
The spelling of 30551420405321 in words is "thirty trillion, five hundred fifty-one billion, four hundred twenty million, four hundred five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •