Base | Representation |
---|---|
bin | 1110001101000000… |
… | …1010001100110001 |
3 | 100211201012101220222 |
4 | 3203100022030301 |
5 | 30302020222423 |
6 | 1430154342425 |
7 | 163324052546 |
oct | 34320121461 |
9 | 10751171828 |
10 | 3812664113 |
11 | 1687170a85 |
12 | 8a4a2aa15 |
13 | 489b7c78b |
14 | 28250abcd |
15 | 174abd3c8 |
hex | e340a331 |
3812664113 has 2 divisors, whose sum is σ = 3812664114. Its totient is φ = 3812664112.
The previous prime is 3812664091. The next prime is 3812664131. The reversal of 3812664113 is 3114662183.
Together with next prime (3812664131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3756218944 + 56445169 = 61288^2 + 7513^2 .
It is a cyclic number.
It is not a de Polignac number, because 3812664113 - 28 = 3812663857 is a prime.
It is not a weakly prime, because it can be changed into another prime (3812664143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1906332056 + 1906332057.
It is an arithmetic number, because the mean of its divisors is an integer number (1906332057).
Almost surely, 23812664113 is an apocalyptic number.
It is an amenable number.
3812664113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3812664113 is an equidigital number, since it uses as much as digits as its factorization.
3812664113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736, while the sum is 35.
The square root of 3812664113 is about 61746.7741100699. The cubic root of 3812664113 is about 1562.2223575632. Note that the first 3 decimals are identical.
The spelling of 3812664113 in words is "three billion, eight hundred twelve million, six hundred sixty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •