Base | Representation |
---|---|
bin | 1001011111111111… |
… | …00101110000010001 |
3 | 111011102212021201000 |
4 | 10233333211300101 |
5 | 40421120304121 |
6 | 2202030132213 |
7 | 240246461046 |
oct | 45777456021 |
9 | 14142767630 |
10 | 5100166161 |
11 | 2187a02362 |
12 | ba4051069 |
13 | 63382cbcc |
14 | 3654d71cd |
15 | 1ecb40526 |
hex | 12ffe5c11 |
5100166161 has 16 divisors (see below), whose sum is σ = 7668577600. Its totient is φ = 3349361664.
The previous prime is 5100166111. The next prime is 5100166199. The reversal of 5100166161 is 1616610015.
It is not a de Polignac number, because 5100166161 - 213 = 5100157969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5100166111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1407856 + ... + 1411473.
It is an arithmetic number, because the mean of its divisors is an integer number (479286100).
Almost surely, 25100166161 is an apocalyptic number.
It is an amenable number.
5100166161 is a deficient number, since it is larger than the sum of its proper divisors (2568411439).
5100166161 is a wasteful number, since it uses less digits than its factorization.
5100166161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2819405 (or 2819399 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 5100166161 is about 71415.4476356481. The cubic root of 5100166161 is about 1721.3193141856.
Adding to 5100166161 its reverse (1616610015), we get a palindrome (6716776176).
The spelling of 5100166161 in words is "five billion, one hundred million, one hundred sixty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •