Base | Representation |
---|---|
bin | 1001010100110001… |
… | …10100100111011011 |
3 | 110220212220002222022 |
4 | 10222120310213123 |
5 | 40223031223324 |
6 | 2144430245055 |
7 | 235025203166 |
oct | 45230644733 |
9 | 13825802868 |
10 | 5006117339 |
11 | 2139906063 |
12 | b7865678b |
13 | 61a1c1112 |
14 | 356c14add |
15 | 1e476405e |
hex | 12a6349db |
5006117339 has 4 divisors (see below), whose sum is σ = 5007922824. Its totient is φ = 5004311856.
The previous prime is 5006117327. The next prime is 5006117357. The reversal of 5006117339 is 9337116005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5006117339 is a prime.
It is a super-2 number, since 2×50061173392 = 50122421623672881842, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5006117299 and 5006117308.
It is not an unprimeable number, because it can be changed into a prime (5006117239) 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 3 ways as a sum of consecutive naturals, for example, 898577 + ... + 904130.
It is an arithmetic number, because the mean of its divisors is an integer number (1251980706).
Almost surely, 25006117339 is an apocalyptic number.
5006117339 is a deficient number, since it is larger than the sum of its proper divisors (1805485).
5006117339 is a wasteful number, since it uses less digits than its factorization.
5006117339 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805484.
The product of its (nonzero) digits is 17010, while the sum is 35.
The square root of 5006117339 is about 70753.9210150222. The cubic root of 5006117339 is about 1710.6730293044.
The spelling of 5006117339 in words is "five billion, six million, one hundred seventeen thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •