Base | Representation |
---|---|
bin | 111101000110010… |
… | …0011001000110101 |
3 | 12021212122101020012 |
4 | 1322030203020311 |
5 | 13144312010010 |
6 | 535232550005 |
7 | 101542435046 |
oct | 17214431065 |
9 | 5255571205 |
10 | 2050110005 |
11 | 962262a99 |
12 | 4926b2305 |
13 | 268970858 |
14 | 1563c08cd |
15 | beeb0005 |
hex | 7a323235 |
2050110005 has 6 divisors (see below), whose sum is σ = 2460253506. Its totient is φ = 1640007008.
The previous prime is 2050110001. The next prime is 2050110199. The reversal of 2050110005 is 5000110502.
It can be written as a sum of positive squares in 3 ways, for example, as 25020004 + 2025090001 = 5002^2 + 45001^2 .
It is not a de Polignac number, because 2050110005 - 22 = 2050110001 is a prime.
It is a super-2 number, since 2×20501100052 = 8405902065202200050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2050110001) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 91121 + ... + 111369.
It is an arithmetic number, because the mean of its divisors is an integer number (410042251).
Almost surely, 22050110005 is an apocalyptic number.
It is an amenable number.
2050110005 is a deficient number, since it is larger than the sum of its proper divisors (410143501).
2050110005 is an frugal number, since it uses more digits than its factorization.
2050110005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40503 (or 20254 counting only the distinct ones).
The product of its (nonzero) digits is 50, while the sum is 14.
The square root of 2050110005 is about 45278.1404763932. The cubic root of 2050110005 is about 1270.3568148216.
Adding to 2050110005 its reverse (5000110502), we get a palindrome (7050220507).
The spelling of 2050110005 in words is "two billion, fifty million, one hundred ten thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •