Base | Representation |
---|---|
bin | 1111001100000000… |
… | …0000000000000001 |
3 | 101112010100010100001 |
4 | 3303000000000001 |
5 | 31322134112424 |
6 | 1512313200001 |
7 | 203012524246 |
oct | 36300000001 |
9 | 11463303301 |
10 | 4076863489 |
11 | 1802312976 |
12 | 959400001 |
13 | 4cc82427a |
14 | 2a96415cd |
15 | 18cda9844 |
hex | f3000001 |
4076863489 has 2 divisors, whose sum is σ = 4076863490. Its totient is φ = 4076863488.
The previous prime is 4076863487. The next prime is 4076863507. The reversal of 4076863489 is 9843686704.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2380659264 + 1696204225 = 48792^2 + 41185^2 .
It is a cyclic number.
It is not a de Polignac number, because 4076863489 - 21 = 4076863487 is a prime.
Together with 4076863487, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (4076863481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a Pierpont prime, being equal to 224 ⋅ 35 + 1.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2038431744 + 2038431745.
It is an arithmetic number, because the mean of its divisors is an integer number (2038431745).
It is a Proth number, since it is equal to 243 ⋅ 224 + 1 and 243 < 224.
Almost surely, 24076863489 is an apocalyptic number.
It is an amenable number.
4076863489 is a deficient number, since it is larger than the sum of its proper divisors (1).
4076863489 is an equidigital number, since it uses as much as digits as its factorization.
4076863489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6967296, while the sum is 55.
The square root of 4076863489 is about 63850.3209780499. The cubic root of 4076863489 is about 1597.5043762345.
The spelling of 4076863489 in words is "four billion, seventy-six million, eight hundred sixty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •