Base | Representation |
---|---|
bin | 1001101100101000… |
… | …01001110110000101 |
3 | 111102211102101110002 |
4 | 10312110021312011 |
5 | 41130243021130 |
6 | 2220335211045 |
7 | 243005066306 |
oct | 46624116605 |
9 | 14384371402 |
10 | 5206220165 |
11 | 22318592a3 |
12 | 1013676a85 |
13 | 64c7b3163 |
14 | 3756227ad |
15 | 2070ddb45 |
hex | 136509d85 |
5206220165 has 8 divisors (see below), whose sum is σ = 6614962200. Its totient is φ = 3919977472.
The previous prime is 5206220143. The next prime is 5206220189. The reversal of 5206220165 is 5610226025.
It can be written as a sum of positive squares in 4 ways, for example, as 118679236 + 5087540929 = 10894^2 + 71327^2 .
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 5206220165 - 26 = 5206220101 is a prime.
It is a super-3 number, since 3×52062201653 (a number of 30 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30624740 + ... + 30624909.
It is an arithmetic number, because the mean of its divisors is an integer number (826870275).
Almost surely, 25206220165 is an apocalyptic number.
It is an amenable number.
5206220165 is a deficient number, since it is larger than the sum of its proper divisors (1408742035).
5206220165 is a wasteful number, since it uses less digits than its factorization.
5206220165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61249671.
The product of its (nonzero) digits is 7200, while the sum is 29.
The square root of 5206220165 is about 72154.1417037165. The cubic root of 5206220165 is about 1733.1687239103.
It can be divided in two parts, 52062 and 20165, that added together give a palindrome (72227).
The spelling of 5206220165 in words is "five billion, two hundred six million, two hundred twenty thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.930 sec. • engine limits •