Base | Representation |
---|---|
bin | 1110110100100111… |
… | …0010011010111101 |
3 | 101021021202020220012 |
4 | 3231021302122331 |
5 | 31122031003023 |
6 | 1454450433005 |
7 | 200411644625 |
oct | 35511623275 |
9 | 11237666805 |
10 | 3978766013 |
11 | 1761a00882 |
12 | 930592765 |
13 | 4b53c8721 |
14 | 29a5c7885 |
15 | 18447d978 |
hex | ed2726bd |
3978766013 has 2 divisors, whose sum is σ = 3978766014. Its totient is φ = 3978766012.
The previous prime is 3978766007. The next prime is 3978766019. The reversal of 3978766013 is 3106678793.
It is a balanced prime because it is at equal distance from previous prime (3978766007) and next prime (3978766019).
It can be written as a sum of positive squares in only one way, i.e., 1989427609 + 1989338404 = 44603^2 + 44602^2 .
It is a cyclic number.
It is not a de Polignac number, because 3978766013 - 28 = 3978765757 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3978766019) 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, 1989383006 + 1989383007.
It is an arithmetic number, because the mean of its divisors is an integer number (1989383007).
Almost surely, 23978766013 is an apocalyptic number.
3978766013 is the 44603-rd centered square number.
It is an amenable number.
3978766013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3978766013 is an equidigital number, since it uses as much as digits as its factorization.
3978766013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 50.
The square root of 3978766013 is about 63077.4604197094. The cubic root of 3978766013 is about 1584.5871624626.
The spelling of 3978766013 in words is "three billion, nine hundred seventy-eight million, seven hundred sixty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •