Base | Representation |
---|---|
bin | 1110111101100000… |
… | …0010101011101001 |
3 | 101100212220211121021 |
4 | 3233120002223221 |
5 | 31211102311230 |
6 | 1502302012441 |
7 | 201343631116 |
oct | 35730025351 |
9 | 11325824537 |
10 | 4016057065 |
11 | 1780a61129 |
12 | 940b77121 |
13 | 4c0054237 |
14 | 2a153390d |
15 | 187897c7a |
hex | ef602ae9 |
4016057065 has 8 divisors (see below), whose sum is σ = 4825396800. Its totient is φ = 3208760112.
The previous prime is 4016057021. The next prime is 4016057069. The reversal of 4016057065 is 5607506104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4016057065 - 215 = 4016024297 is a prime.
It is a super-2 number, since 2×40160570652 = 32257428698672828450, 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 4016057065.
It is not an unprimeable number, because it can be changed into a prime (4016057069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 506365 + ... + 514234.
It is an arithmetic number, because the mean of its divisors is an integer number (603174600).
Almost surely, 24016057065 is an apocalyptic number.
It is an amenable number.
4016057065 is a deficient number, since it is larger than the sum of its proper divisors (809339735).
4016057065 is a wasteful number, since it uses less digits than its factorization.
4016057065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021391.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 4016057065 is about 63372.3683082777. The cubic root of 4016057065 is about 1589.5222995670.
The spelling of 4016057065 in words is "four billion, sixteen million, fifty-seven thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •