Base | Representation |
---|---|
bin | 1001100111111000… |
… | …11111100001000001 |
3 | 111100001121111221000 |
4 | 10303330133201001 |
5 | 41040103304131 |
6 | 2212355122213 |
7 | 242013132315 |
oct | 46374374101 |
9 | 14301544830 |
10 | 5166463041 |
11 | 2211374173 |
12 | 10022a3369 |
13 | 6444a302c |
14 | 370233b45 |
15 | 203888ce6 |
hex | 133f1f841 |
5166463041 has 8 divisors (see below), whose sum is σ = 7654019360. Its totient is φ = 3444308676.
The previous prime is 5166462989. The next prime is 5166463121. The reversal of 5166463041 is 1403646615.
It is a happy number.
5166463041 is a `hidden beast` number, since 5 + 1 + 6 + 646 + 3 + 0 + 4 + 1 = 666.
It is not a de Polignac number, because 5166463041 - 27 = 5166462913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5166462987 and 5166463005.
It is not an unprimeable number, because it can be changed into a prime (5166463241) 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 7 ways as a sum of consecutive naturals, for example, 95675215 + ... + 95675268.
It is an arithmetic number, because the mean of its divisors is an integer number (956752420).
Almost surely, 25166463041 is an apocalyptic number.
It is an amenable number.
5166463041 is a deficient number, since it is larger than the sum of its proper divisors (2487556319).
5166463041 is a wasteful number, since it uses less digits than its factorization.
5166463041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191350492 (or 191350486 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The square root of 5166463041 is about 71878.1123917427. The cubic root of 5166463041 is about 1728.7456845098.
The spelling of 5166463041 in words is "five billion, one hundred sixty-six million, four hundred sixty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •