Base | Representation |
---|---|
bin | 1001011101101110… |
… | …00010011100100011 |
3 | 111010010002000112222 |
4 | 10232313002130203 |
5 | 40401233202141 |
6 | 2200110341255 |
7 | 236626016102 |
oct | 45667023443 |
9 | 14103060488 |
10 | 5081147171 |
11 | 21781a2091 |
12 | b997ba82b |
13 | 62c901179 |
14 | 362b86039 |
15 | 1eb13514b |
hex | 12edc2723 |
5081147171 has 4 divisors (see below), whose sum is σ = 5082778344. Its totient is φ = 5079516000.
The previous prime is 5081147147. The next prime is 5081147213. The reversal of 5081147171 is 1717411805.
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-5081147171 is a prime.
It is a super-2 number, since 2×50811471712 = 51636113146722606482, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5081141171) 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, 810905 + ... + 817146.
It is an arithmetic number, because the mean of its divisors is an integer number (1270694586).
Almost surely, 25081147171 is an apocalyptic number.
5081147171 is a deficient number, since it is larger than the sum of its proper divisors (1631173).
5081147171 is a wasteful number, since it uses less digits than its factorization.
5081147171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1631172.
The product of its (nonzero) digits is 7840, while the sum is 35.
The square root of 5081147171 is about 71282.1658691710. The cubic root of 5081147171 is about 1719.1769961812.
Adding to 5081147171 its reverse (1717411805), we get a palindrome (6798558976).
The spelling of 5081147171 in words is "five billion, eighty-one million, one hundred forty-seven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •