Base | Representation |
---|---|
bin | 111011110000010… |
… | …0100100011111101 |
3 | 12011201210221001211 |
4 | 1313200210203331 |
5 | 13101241331234 |
6 | 530542404421 |
7 | 100454306653 |
oct | 16740444375 |
9 | 5151727054 |
10 | 2005027069 |
11 | 939870571 |
12 | 47b590711 |
13 | 25c517566 |
14 | 150406dd3 |
15 | bb057164 |
hex | 778248fd |
2005027069 has 2 divisors, whose sum is σ = 2005027070. Its totient is φ = 2005027068.
The previous prime is 2005027033. The next prime is 2005027103. The reversal of 2005027069 is 9607205002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1256348025 + 748679044 = 35445^2 + 27362^2 .
It is a cyclic number.
It is not a de Polignac number, because 2005027069 - 213 = 2005018877 is a prime.
It is a super-2 number, since 2×20050270692 = 8040267094845461522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2005027069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2005027009) 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 as a sum of consecutive naturals, namely, 1002513534 + 1002513535.
It is an arithmetic number, because the mean of its divisors is an integer number (1002513535).
Almost surely, 22005027069 is an apocalyptic number.
It is an amenable number.
2005027069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2005027069 is an equidigital number, since it uses as much as digits as its factorization.
2005027069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 2005027069 is about 44777.5286164835. The cubic root of 2005027069 is about 1260.9757850255.
The spelling of 2005027069 in words is "two billion, five million, twenty-seven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •