Base | Representation |
---|---|
bin | 1001100111111010… |
… | …00000101110000111 |
3 | 111100001212102111021 |
4 | 10303331000232013 |
5 | 41040122132142 |
6 | 2212402052011 |
7 | 242014236661 |
oct | 46375005607 |
9 | 14301772437 |
10 | 5166599047 |
11 | 2211457375 |
12 | 100234a007 |
13 | 64451cbcc |
14 | 37026b531 |
15 | 2038b4267 |
hex | 133f40b87 |
5166599047 has 8 divisors (see below), whose sum is σ = 5475568896. Its totient is φ = 4858190592.
The previous prime is 5166599021. The next prime is 5166599057. The reversal of 5166599047 is 7409956615.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5166599047 - 211 = 5166596999 is a prime.
It is a super-2 number, since 2×51665990472 = 53387491424922616418, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5166598985 and 5166599003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5166599057) 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, 121318 + ... + 158275.
It is an arithmetic number, because the mean of its divisors is an integer number (684446112).
Almost surely, 25166599047 is an apocalyptic number.
5166599047 is a deficient number, since it is larger than the sum of its proper divisors (308969849).
5166599047 is a wasteful number, since it uses less digits than its factorization.
5166599047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280697.
The product of its (nonzero) digits is 2041200, while the sum is 52.
The square root of 5166599047 is about 71879.0584732438. The cubic root of 5166599047 is about 1728.7608539930.
The spelling of 5166599047 in words is "five billion, one hundred sixty-six million, five hundred ninety-nine thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •