Base | Representation |
---|---|
bin | 111110001010111… |
… | …1011001111010001 |
3 | 12101101102000000102 |
4 | 1330111323033101 |
5 | 13233021404244 |
6 | 543000502145 |
7 | 102460514435 |
oct | 17425731721 |
9 | 5341360012 |
10 | 2086122449 |
11 | 98061a744 |
12 | 4a277a955 |
13 | 27326c3a8 |
14 | 15b0b69c5 |
15 | c322554e |
hex | 7c57b3d1 |
2086122449 has 4 divisors (see below), whose sum is σ = 2107628964. Its totient is φ = 2064615936.
The previous prime is 2086122439. The next prime is 2086122457. The reversal of 2086122449 is 9442216802.
It is a happy number.
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 544382224 + 1541740225 = 23332^2 + 39265^2 .
It is a cyclic number.
It is not a de Polignac number, because 2086122449 - 24 = 2086122433 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2086122439) 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, 10753112 + ... + 10753305.
It is an arithmetic number, because the mean of its divisors is an integer number (526907241).
Almost surely, 22086122449 is an apocalyptic number.
It is an amenable number.
2086122449 is a deficient number, since it is larger than the sum of its proper divisors (21506515).
2086122449 is an equidigital number, since it uses as much as digits as its factorization.
2086122449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21506514.
The product of its (nonzero) digits is 55296, while the sum is 38.
The square root of 2086122449 is about 45674.0894709462. The cubic root of 2086122449 is about 1277.7520866699.
The spelling of 2086122449 in words is "two billion, eighty-six million, one hundred twenty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •