Base | Representation |
---|---|
bin | 1001010100010010… |
… | …11111110111101101 |
3 | 110220121100000111120 |
4 | 10222021133313231 |
5 | 40221014201310 |
6 | 2144204211153 |
7 | 234646102344 |
oct | 45211376755 |
9 | 13817300446 |
10 | 5002100205 |
11 | 2137611a13 |
12 | b77239ab9 |
13 | 61941580b |
14 | 35648ab5b |
15 | 1e421db70 |
hex | 12a25fded |
5002100205 has 8 divisors (see below), whose sum is σ = 8003360352. Its totient is φ = 2667786768.
The previous prime is 5002100203. The next prime is 5002100209. The reversal of 5002100205 is 5020012005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5002100205 - 21 = 5002100203 is a prime.
It is a super-2 number, since 2×50021002052 = 50042012921722084050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 333473347 = 5002100205 / (5 + 0 + 0 + 2 + 1 + 0 + 0 + 2 + 0 + 5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5002100203) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166736659 + ... + 166736688.
It is an arithmetic number, because the mean of its divisors is an integer number (1000420044).
Almost surely, 25002100205 is an apocalyptic number.
It is an amenable number.
5002100205 is a deficient number, since it is larger than the sum of its proper divisors (3001260147).
5002100205 is a wasteful number, since it uses less digits than its factorization.
5002100205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333473355.
The product of its (nonzero) digits is 100, while the sum is 15.
The square root of 5002100205 is about 70725.5272514811. The cubic root of 5002100205 is about 1710.2153331647.
The spelling of 5002100205 in words is "five billion, two million, one hundred thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •