Base | Representation |
---|---|
bin | 111011110110011… |
… | …1101101000100101 |
3 | 12011221220222001211 |
4 | 1313230331220211 |
5 | 13103104303433 |
6 | 531140151421 |
7 | 100524026410 |
oct | 16754755045 |
9 | 5157828054 |
10 | 2008275493 |
11 | 94068a114 |
12 | 480698571 |
13 | 2600b3cc3 |
14 | 150a10b77 |
15 | bb4998cd |
hex | 77b3da25 |
2008275493 has 4 divisors (see below), whose sum is σ = 2295172000. Its totient is φ = 1721378988.
The previous prime is 2008275469. The next prime is 2008275527. The reversal of 2008275493 is 3945728002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3945728002 = 2 ⋅1972864001.
It is not a de Polignac number, because 2008275493 - 25 = 2008275461 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 (2008275443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 143448243 + ... + 143448256.
It is an arithmetic number, because the mean of its divisors is an integer number (573793000).
Almost surely, 22008275493 is an apocalyptic number.
It is an amenable number.
2008275493 is a deficient number, since it is larger than the sum of its proper divisors (286896507).
2008275493 is an equidigital number, since it uses as much as digits as its factorization.
2008275493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286896506.
The product of its (nonzero) digits is 120960, while the sum is 40.
The square root of 2008275493 is about 44813.7868629733. The cubic root of 2008275493 is about 1261.6564032452.
The spelling of 2008275493 in words is "two billion, eight million, two hundred seventy-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •