Base | Representation |
---|---|
bin | 1110111111101110… |
… | …0101000001011001 |
3 | 101101112110010100001 |
4 | 3233323211001121 |
5 | 31220443412021 |
6 | 1503233413001 |
7 | 201516050434 |
oct | 35773450131 |
9 | 11345403301 |
10 | 4025372761 |
11 | 1786244153 |
12 | 94410a161 |
13 | 4c1c66497 |
14 | 2a287a81b |
15 | 1885d8091 |
hex | efee5059 |
4025372761 has 32 divisors (see below), whose sum is σ = 4567062528. Its totient is φ = 3527758080.
The previous prime is 4025372749. The next prime is 4025372773. The reversal of 4025372761 is 1672735204.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (4025372749) and next prime (4025372773).
It is a cyclic number.
It is not a de Polignac number, because 4025372761 - 221 = 4023275609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4025372761.
It is not an unprimeable number, because it can be changed into a prime (4025372711) 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 in 31 ways as a sum of consecutive naturals, for example, 2303290 + ... + 2305036.
It is an arithmetic number, because the mean of its divisors is an integer number (142720704).
Almost surely, 24025372761 is an apocalyptic number.
It is an amenable number.
4025372761 is a deficient number, since it is larger than the sum of its proper divisors (541689767).
4025372761 is a wasteful number, since it uses less digits than its factorization.
4025372761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1941.
The product of its (nonzero) digits is 70560, while the sum is 37.
The square root of 4025372761 is about 63445.8254024644. The cubic root of 4025372761 is about 1590.7503757451.
The spelling of 4025372761 in words is "four billion, twenty-five million, three hundred seventy-two thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •