Base | Representation |
---|---|
bin | 1011001110011010… |
… | …0110110001111101 |
3 | 21202222221112220212 |
4 | 2303212212301331 |
5 | 22132342220411 |
6 | 1215000122205 |
7 | 134446064021 |
oct | 26346466175 |
9 | 7688845825 |
10 | 3013241981 |
11 | 1306995332 |
12 | 701166365 |
13 | 39036c929 |
14 | 208292381 |
15 | 12980c68b |
hex | b39a6c7d |
3013241981 has 2 divisors, whose sum is σ = 3013241982. Its totient is φ = 3013241980.
The previous prime is 3013241971. The next prime is 3013242007. The reversal of 3013241981 is 1891423103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2437001956 + 576240025 = 49366^2 + 24005^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3013241981 is a prime.
It is a super-2 number, since 2×30132419812 = 18159254472121608722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3013241971) 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, 1506620990 + 1506620991.
It is an arithmetic number, because the mean of its divisors is an integer number (1506620991).
Almost surely, 23013241981 is an apocalyptic number.
It is an amenable number.
3013241981 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013241981 is an equidigital number, since it uses as much as digits as its factorization.
3013241981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 3013241981 is about 54893.0048457907. The cubic root of 3013241981 is about 1444.3684825600.
The spelling of 3013241981 in words is "three billion, thirteen million, two hundred forty-one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •