Base | Representation |
---|---|
bin | 1001101000001110… |
… | …01100010111101101 |
3 | 111100020220000212222 |
4 | 10310013030113231 |
5 | 41041313040310 |
6 | 2212535205125 |
7 | 242046024533 |
oct | 46407142755 |
9 | 14306800788 |
10 | 5169268205 |
11 | 2212a0a792 |
12 | 10032167a5 |
13 | 644c45aaa |
14 | 370764153 |
15 | 203c40055 |
hex | 1341cc5ed |
5169268205 has 4 divisors (see below), whose sum is σ = 6203121852. Its totient is φ = 4135414560.
The previous prime is 5169268201. The next prime is 5169268207. The reversal of 5169268205 is 5028629615.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2709306601 + 2459961604 = 52051^2 + 49598^2 .
It is not a de Polignac number, because 5169268205 - 22 = 5169268201 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5169268201) 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 3 ways as a sum of consecutive naturals, for example, 516926816 + ... + 516926825.
It is an arithmetic number, because the mean of its divisors is an integer number (1550780463).
Almost surely, 25169268205 is an apocalyptic number.
It is an amenable number.
5169268205 is a deficient number, since it is larger than the sum of its proper divisors (1033853647).
5169268205 is a wasteful number, since it uses less digits than its factorization.
5169268205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1033853646.
The product of its (nonzero) digits is 259200, while the sum is 44.
The square root of 5169268205 is about 71897.6230831034. The cubic root of 5169268205 is about 1729.0585057257.
The spelling of 5169268205 in words is "five billion, one hundred sixty-nine million, two hundred sixty-eight thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •