Base | Representation |
---|---|
bin | 1111000111110000… |
… | …0010111111100101 |
3 | 101110212211002202121 |
4 | 3301330002333211 |
5 | 31303104044312 |
6 | 1510435305541 |
7 | 202405232614 |
oct | 36174027745 |
9 | 11425732677 |
10 | 4059049957 |
11 | 17a3256346 |
12 | 95344b2b1 |
13 | 4c8c28111 |
14 | 2a712587b |
15 | 18b53b707 |
hex | f1f02fe5 |
4059049957 has 4 divisors (see below), whose sum is σ = 4064384556. Its totient is φ = 4053715360.
The previous prime is 4059049937. The next prime is 4059049987. The reversal of 4059049957 is 7599409504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 695165956 + 3363884001 = 26366^2 + 57999^2 .
It is a cyclic number.
It is not a de Polignac number, because 4059049957 - 227 = 3924832229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4059049937) 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 3 ways as a sum of consecutive naturals, for example, 2666158 + ... + 2667679.
It is an arithmetic number, because the mean of its divisors is an integer number (1016096139).
Almost surely, 24059049957 is an apocalyptic number.
It is an amenable number.
4059049957 is a deficient number, since it is larger than the sum of its proper divisors (5334599).
4059049957 is an equidigital number, since it uses as much as digits as its factorization.
4059049957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5334598.
The product of its (nonzero) digits is 2041200, while the sum is 52.
The square root of 4059049957 is about 63710.6738074555. The cubic root of 4059049957 is about 1595.1742562405.
The spelling of 4059049957 in words is "four billion, fifty-nine million, forty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •