Base | Representation |
---|---|
bin | 1110001011011011… |
… | …0101101001001001 |
3 | 100211020201011120112 |
4 | 3202312311221021 |
5 | 30243320320223 |
6 | 1425400204105 |
7 | 163213455425 |
oct | 34266655111 |
9 | 10736634515 |
10 | 3806026313 |
11 | 16834479a1 |
12 | 8a2769635 |
13 | 48869739b |
14 | 28169db85 |
15 | 17420b778 |
hex | e2db5a49 |
3806026313 has 2 divisors, whose sum is σ = 3806026314. Its totient is φ = 3806026312.
The previous prime is 3806026309. The next prime is 3806026327. The reversal of 3806026313 is 3136206083.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3806026249 + 64 = 61693^2 + 8^2 .
It is a cyclic number.
It is not a de Polignac number, because 3806026313 - 22 = 3806026309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3806026313.
It is not a weakly prime, because it can be changed into another prime (3806026303) 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, 1903013156 + 1903013157.
It is an arithmetic number, because the mean of its divisors is an integer number (1903013157).
Almost surely, 23806026313 is an apocalyptic number.
It is an amenable number.
3806026313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3806026313 is an equidigital number, since it uses as much as digits as its factorization.
3806026313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The square root of 3806026313 is about 61693.0005186974. Note that the first 3 decimals coincide. The cubic root of 3806026313 is about 1561.3152278035.
The spelling of 3806026313 in words is "three billion, eight hundred six million, twenty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •