Base | Representation |
---|---|
bin | 1111000010111111… |
… | …0000110111011001 |
3 | 101102111012010202201 |
4 | 3300233300313121 |
5 | 31232444142021 |
6 | 1504442530201 |
7 | 202043245012 |
oct | 36057606731 |
9 | 11374163681 |
10 | 4039052761 |
11 | 1792a38137 |
12 | 948806961 |
13 | 4c4a46063 |
14 | 2a45dc009 |
15 | 1898db591 |
hex | f0bf0dd9 |
4039052761 has 2 divisors, whose sum is σ = 4039052762. Its totient is φ = 4039052760.
The previous prime is 4039052753. The next prime is 4039052767. The reversal of 4039052761 is 1672509304.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3874315536 + 164737225 = 62244^2 + 12835^2 .
It is a cyclic number.
It is not a de Polignac number, because 4039052761 - 23 = 4039052753 is a prime.
It is a super-2 number, since 2×40390527612 = 32627894412283446242, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4039052761.
It is not a weakly prime, because it can be changed into another prime (4039052767) 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, 2019526380 + 2019526381.
It is an arithmetic number, because the mean of its divisors is an integer number (2019526381).
Almost surely, 24039052761 is an apocalyptic number.
It is an amenable number.
4039052761 is a deficient number, since it is larger than the sum of its proper divisors (1).
4039052761 is an equidigital number, since it uses as much as digits as its factorization.
4039052761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 37.
The square root of 4039052761 is about 63553.5424740431. The cubic root of 4039052761 is about 1592.5503630729.
The spelling of 4039052761 in words is "four billion, thirty-nine million, fifty-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •