Base | Representation |
---|---|
bin | 11100001001010001… |
… | …010111110011101101 |
3 | 2220000002212022120102 |
4 | 130021101113303231 |
5 | 443342400214411 |
6 | 21514422200445 |
7 | 2116613324105 |
oct | 341121276355 |
9 | 86002768512 |
10 | 30220319981 |
11 | 118a8645765 |
12 | 5a34883125 |
13 | 2b07c15357 |
14 | 16697da205 |
15 | bbd148d3b |
hex | 709457ced |
30220319981 has 2 divisors, whose sum is σ = 30220319982. Its totient is φ = 30220319980.
The previous prime is 30220319951. The next prime is 30220320019. The reversal of 30220319981 is 18991302203.
It is an a-pointer prime, because the next prime (30220320019) can be obtained adding 30220319981 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16004527081 + 14215792900 = 126509^2 + 119230^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30220319981 is a prime.
It is a super-2 number, since 2×302203199812 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30220319951) 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, 15110159990 + 15110159991.
It is an arithmetic number, because the mean of its divisors is an integer number (15110159991).
Almost surely, 230220319981 is an apocalyptic number.
It is an amenable number.
30220319981 is a deficient number, since it is larger than the sum of its proper divisors (1).
30220319981 is an equidigital number, since it uses as much as digits as its factorization.
30220319981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 38.
The spelling of 30220319981 in words is "thirty billion, two hundred twenty million, three hundred nineteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •