Base | Representation |
---|---|
bin | 1001010000000000… |
… | …11010101000011001 |
3 | 110211002201022200200 |
4 | 10220000122220121 |
5 | 40132314240032 |
6 | 2140442052413 |
7 | 234031464132 |
oct | 45000325031 |
9 | 13732638620 |
10 | 4966165017 |
11 | 21192a8310 |
12 | b671aa109 |
13 | 611b431a8 |
14 | 3517b4c89 |
15 | 1e0ec147c |
hex | 12801aa19 |
4966165017 has 24 divisors (see below), whose sum is σ = 7829822208. Its totient is φ = 3008124000.
The previous prime is 4966165013. The next prime is 4966165021. The reversal of 4966165017 is 7105616694.
It is an interprime number because it is at equal distance from previous prime (4966165013) and next prime (4966165021).
It is not a de Polignac number, because 4966165017 - 22 = 4966165013 is a prime.
It is a super-2 number, since 2×49661650172 = 49325589952149220578, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (4966165013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 178392 + ... + 204342.
It is an arithmetic number, because the mean of its divisors is an integer number (326242592).
Almost surely, 24966165017 is an apocalyptic number.
It is an amenable number.
4966165017 is a deficient number, since it is larger than the sum of its proper divisors (2863657191).
4966165017 is a wasteful number, since it uses less digits than its factorization.
4966165017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27901 (or 27898 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 4966165017 is about 70471.0225340884. The cubic root of 4966165017 is about 1706.1100796102.
The spelling of 4966165017 in words is "four billion, nine hundred sixty-six million, one hundred sixty-five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •