Base | Representation |
---|---|
bin | 1110110101100110… |
… | …0110011001100001 |
3 | 101021120112211211221 |
4 | 3231121212121201 |
5 | 31124111123243 |
6 | 1455115335041 |
7 | 200462120431 |
oct | 35531463141 |
9 | 11246484757 |
10 | 3982911073 |
11 | 1764282049 |
12 | 931a51481 |
13 | 4b621a31b |
14 | 29ad862c1 |
15 | 1849ebbed |
hex | ed666661 |
3982911073 has 2 divisors, whose sum is σ = 3982911074. Its totient is φ = 3982911072.
The previous prime is 3982911071. The next prime is 3982911091. The reversal of 3982911073 is 3701192893.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3130738209 + 852172864 = 55953^2 + 29192^2 .
It is a cyclic number.
It is not a de Polignac number, because 3982911073 - 21 = 3982911071 is a prime.
It is a super-2 number, since 2×39829110732 = 31727161230852022658, which contains 22 as substring.
Together with 3982911071, it forms a pair of twin primes.
It is a nialpdrome in base 16.
It is not a weakly prime, because it can be changed into another prime (3982911071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1991455536 + 1991455537.
It is an arithmetic number, because the mean of its divisors is an integer number (1991455537).
Almost surely, 23982911073 is an apocalyptic number.
It is an amenable number.
3982911073 is a deficient number, since it is larger than the sum of its proper divisors (1).
3982911073 is an equidigital number, since it uses as much as digits as its factorization.
3982911073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 43.
The square root of 3982911073 is about 63110.3087696455. The cubic root of 3982911073 is about 1585.1372433379.
The spelling of 3982911073 in words is "three billion, nine hundred eighty-two million, nine hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •