Base | Representation |
---|---|
bin | 1001101000011110… |
… | …11000001011101011 |
3 | 111100101221001000012 |
4 | 10310033120023223 |
5 | 41042340214424 |
6 | 2213053202135 |
7 | 242103201662 |
oct | 46417301353 |
9 | 14311831005 |
10 | 5171413739 |
11 | 2214145758 |
12 | 1003a9034b |
13 | 64551753b |
14 | 370b61dd9 |
15 | 204015b0e |
hex | 1343d82eb |
5171413739 has 4 divisors (see below), whose sum is σ = 5171563824. Its totient is φ = 5171263656.
The previous prime is 5171413729. The next prime is 5171413747. The reversal of 5171413739 is 9373141715.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5171413739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5171413696 and 5171413705.
It is not an unprimeable number, because it can be changed into a prime (5171413729) 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, 5354 + ... + 101840.
It is an arithmetic number, because the mean of its divisors is an integer number (1292890956).
Almost surely, 25171413739 is an apocalyptic number.
5171413739 is a deficient number, since it is larger than the sum of its proper divisors (150085).
5171413739 is an equidigital number, since it uses as much as digits as its factorization.
5171413739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150084.
The product of its digits is 79380, while the sum is 41.
The square root of 5171413739 is about 71912.5422927044. The cubic root of 5171413739 is about 1729.2976911404.
The spelling of 5171413739 in words is "five billion, one hundred seventy-one million, four hundred thirteen thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •