Base | Representation |
---|---|
bin | 1101101001110000100001… |
… | …01011011011101011010001 |
3 | 10221022002021212001001202122 |
4 | 12310320100223123223101 |
5 | 12413340230403020144 |
6 | 143503543553024025 |
7 | 6216011440561121 |
oct | 664702053335321 |
9 | 127262255031678 |
10 | 30022101220049 |
11 | 9625335511874 |
12 | 344a598b55015 |
13 | 139a0c2241153 |
14 | 75b112758c81 |
15 | 370e2524d7ee |
hex | 1b4e10adbad1 |
30022101220049 has 2 divisors, whose sum is σ = 30022101220050. Its totient is φ = 30022101220048.
The previous prime is 30022101220003. The next prime is 30022101220063. The reversal of 30022101220049 is 94002210122003.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30004320864400 + 17780355649 = 5477620^2 + 133343^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30022101220049 is a prime.
It is a super-3 number, since 3×300221012200493 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (30022101226049) 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, 15011050610024 + 15011050610025.
It is an arithmetic number, because the mean of its divisors is an integer number (15011050610025).
Almost surely, 230022101220049 is an apocalyptic number.
It is an amenable number.
30022101220049 is a deficient number, since it is larger than the sum of its proper divisors (1).
30022101220049 is an equidigital number, since it uses as much as digits as its factorization.
30022101220049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
The spelling of 30022101220049 in words is "thirty trillion, twenty-two billion, one hundred one million, two hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •