Base | Representation |
---|---|
bin | 1001100101100100… |
… | …10011011001010101 |
3 | 111021201000102212121 |
4 | 10302302103121111 |
5 | 41020113432431 |
6 | 2210422215541 |
7 | 241355621611 |
oct | 46262233125 |
9 | 14251012777 |
10 | 5147014741 |
11 | 22013a03a0 |
12 | bb78845b1 |
13 | 640453a6b |
14 | 36b810341 |
15 | 201ce6611 |
hex | 132c93655 |
5147014741 has 8 divisors (see below), whose sum is σ = 5945215104. Its totient is φ = 4403862720.
The previous prime is 5147014729. The next prime is 5147014753. The reversal of 5147014741 is 1474107415.
It is an interprime number because it is at equal distance from previous prime (5147014729) and next prime (5147014753).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5147014741 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5147014697 and 5147014706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5147014781) 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, 13761885 + ... + 13762258.
It is an arithmetic number, because the mean of its divisors is an integer number (743151888).
Almost surely, 25147014741 is an apocalyptic number.
It is an amenable number.
5147014741 is a deficient number, since it is larger than the sum of its proper divisors (798200363).
5147014741 is a wasteful number, since it uses less digits than its factorization.
5147014741 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27524171.
The product of its (nonzero) digits is 15680, while the sum is 34.
The square root of 5147014741 is about 71742.6981720091. The cubic root of 5147014741 is about 1726.5737640560.
The spelling of 5147014741 in words is "five billion, one hundred forty-seven million, fourteen thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •