Base | Representation |
---|---|
bin | 1001011101110101… |
… | …10000010110100111 |
3 | 111010011220112021101 |
4 | 10232322300112213 |
5 | 40402010343024 |
6 | 2200143300531 |
7 | 236640215110 |
oct | 45672602647 |
9 | 14104815241 |
10 | 5082121639 |
11 | 21787a8231 |
12 | b99baa747 |
13 | 62cb8288a |
14 | 362d5b207 |
15 | 1eb278c44 |
hex | 12eeb05a7 |
5082121639 has 8 divisors (see below), whose sum is σ = 5840588160. Its totient is φ = 4331767416.
The previous prime is 5082121637. The next prime is 5082121657. The reversal of 5082121639 is 9361212805.
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 5082121639 - 21 = 5082121637 is a prime.
It is a super-3 number, since 3×50821216393 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5082121598 and 5082121607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5082121633) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2026729 + ... + 2029234.
It is an arithmetic number, because the mean of its divisors is an integer number (730073520).
Almost surely, 25082121639 is an apocalyptic number.
5082121639 is a deficient number, since it is larger than the sum of its proper divisors (758466521).
5082121639 is a wasteful number, since it uses less digits than its factorization.
5082121639 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4056149.
The product of its (nonzero) digits is 25920, while the sum is 37.
The square root of 5082121639 is about 71289.0008276172. Note that the first 3 decimals coincide. The cubic root of 5082121639 is about 1719.2868910421.
The spelling of 5082121639 in words is "five billion, eighty-two million, one hundred twenty-one thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •