Base | Representation |
---|---|
bin | 1010100011010100… |
… | …10010101001101111 |
3 | 112121210201020100222 |
4 | 11101222102221233 |
5 | 43100220230424 |
6 | 2334044441555 |
7 | 260245530002 |
oct | 52152225157 |
9 | 15553636328 |
10 | 5665008239 |
11 | 24478275a0 |
12 | 11212492bb |
13 | 6c3868ba7 |
14 | 3ba52b539 |
15 | 232515e5e |
hex | 151a92a6f |
5665008239 has 16 divisors (see below), whose sum is σ = 6244356096. Its totient is φ = 5096666400.
The previous prime is 5665008233. The next prime is 5665008241. The reversal of 5665008239 is 9328005665.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5665008239 is a prime.
It is a super-2 number, since 2×56650082392 = 64184636695875762242, 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 5665008239.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5665008233) 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 15 ways as a sum of consecutive naturals, for example, 407054 + ... + 420740.
It is an arithmetic number, because the mean of its divisors is an integer number (390272256).
Almost surely, 25665008239 is an apocalyptic number.
5665008239 is a deficient number, since it is larger than the sum of its proper divisors (579347857).
5665008239 is a wasteful number, since it uses less digits than its factorization.
5665008239 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14086.
The product of its (nonzero) digits is 388800, while the sum is 44.
The square root of 5665008239 is about 75266.2490031222. The cubic root of 5665008239 is about 1782.6531405166.
The spelling of 5665008239 in words is "five billion, six hundred sixty-five million, eight thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •