Base | Representation |
---|---|
bin | 1001100001111001… |
… | …01010011011010011 |
3 | 111012112222200012002 |
4 | 10300330222123103 |
5 | 40434220113313 |
6 | 2203401224215 |
7 | 240532531154 |
oct | 46074523323 |
9 | 14175880162 |
10 | 5116176083 |
11 | 2195a478a7 |
12 | ba949206b |
13 | 636c47135 |
14 | 3676a392b |
15 | 1ee254058 |
hex | 130f2a6d3 |
5116176083 has 4 divisors (see below), whose sum is σ = 5135629488. Its totient is φ = 5096722680.
The previous prime is 5116176071. The next prime is 5116176119. The reversal of 5116176083 is 3806716115.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3806716115 = 5 ⋅761343223.
It is a cyclic number.
It is not a de Polignac number, because 5116176083 - 24 = 5116176067 is a prime.
It is a super-2 number, since 2×51161760832 = 52350515424522445778, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5116196083) 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, 9726308 + ... + 9726833.
It is an arithmetic number, because the mean of its divisors is an integer number (1283907372).
Almost surely, 25116176083 is an apocalyptic number.
5116176083 is a deficient number, since it is larger than the sum of its proper divisors (19453405).
5116176083 is a wasteful number, since it uses less digits than its factorization.
5116176083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19453404.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 5116176083 is about 71527.4498566809. The cubic root of 5116176083 is about 1723.1185628976.
The spelling of 5116176083 in words is "five billion, one hundred sixteen million, one hundred seventy-six thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •