Base | Representation |
---|---|
bin | 101101011001110000010… |
… | …010110000011010011101 |
3 | 102001021100021022022201012 |
4 | 231121300102300122131 |
5 | 402104310214100411 |
6 | 10345153323425005 |
7 | 441262154211161 |
oct | 55316022603235 |
9 | 12037307268635 |
10 | 3120030221981 |
11 | aa32197a3042 |
12 | 424823985165 |
13 | 1982aa0692aa |
14 | ab020268ca1 |
15 | 5625c1b918b |
hex | 2d6704b069d |
3120030221981 has 2 divisors, whose sum is σ = 3120030221982. Its totient is φ = 3120030221980.
The previous prime is 3120030221941. The next prime is 3120030222013. The reversal of 3120030221981 is 1891220300213.
It is an a-pointer prime, because the next prime (3120030222013) can be obtained adding 3120030221981 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2795135921956 + 324894300025 = 1671866^2 + 569995^2 .
It is a cyclic number.
It is not a de Polignac number, because 3120030221981 - 214 = 3120030205597 is a prime.
It is a super-2 number, since 2×31200302219812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3120030221911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1560015110990 + 1560015110991.
It is an arithmetic number, because the mean of its divisors is an integer number (1560015110991).
Almost surely, 23120030221981 is an apocalyptic number.
It is an amenable number.
3120030221981 is a deficient number, since it is larger than the sum of its proper divisors (1).
3120030221981 is an equidigital number, since it uses as much as digits as its factorization.
3120030221981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 3120030221981 in words is "three trillion, one hundred twenty billion, thirty million, two hundred twenty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •