Base | Representation |
---|---|
bin | 1001011011001110… |
… | …01001110111100001 |
3 | 111001122200002201212 |
4 | 10231213021313201 |
5 | 40330403043144 |
6 | 2154041435505 |
7 | 236253020213 |
oct | 45547116741 |
9 | 14048602655 |
10 | 5060206049 |
11 | 2167399778 |
12 | b9279bb95 |
13 | 62847b582 |
14 | 3600945b3 |
15 | 1e939a49e |
hex | 12d9c9de1 |
5060206049 has 4 divisors (see below), whose sum is σ = 5076477120. Its totient is φ = 5043934980.
The previous prime is 5060206031. The next prime is 5060206069. The reversal of 5060206049 is 9406020605.
5060206049 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9406020605 = 5 ⋅1881204121.
It is a cyclic number.
It is not a de Polignac number, because 5060206049 - 224 = 5043428833 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5060206069) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8135069 + ... + 8135690.
It is an arithmetic number, because the mean of its divisors is an integer number (1269119280).
Almost surely, 25060206049 is an apocalyptic number.
It is an amenable number.
5060206049 is a deficient number, since it is larger than the sum of its proper divisors (16271071).
5060206049 is a wasteful number, since it uses less digits than its factorization.
5060206049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16271070.
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 5060206049 is about 71135.1252828024. The cubic root of 5060206049 is about 1716.8119746838.
The spelling of 5060206049 in words is "five billion, sixty million, two hundred six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •