Base | Representation |
---|---|
bin | 1010000000111110… |
… | …1101111101101101 |
3 | 20221100211200100202 |
4 | 2200033231331231 |
5 | 21001222144424 |
6 | 1122435203245 |
7 | 123423442334 |
oct | 24017557555 |
9 | 6840750322 |
10 | 2688474989 |
11 | 115a635062 |
12 | 630446525 |
13 | 33acaca05 |
14 | 1b70b2d1b |
15 | 10b05a2ae |
hex | a03edf6d |
2688474989 has 8 divisors (see below), whose sum is σ = 2719444728. Its totient is φ = 2657571840.
The previous prime is 2688474983. The next prime is 2688475003. The reversal of 2688474989 is 9894748862.
It can be written as a sum of positive squares in 4 ways, for example, as 392436100 + 2296038889 = 19810^2 + 47917^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2688474989 - 24 = 2688474973 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 (2688474983) 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 7 ways as a sum of consecutive naturals, for example, 66959 + ... + 99299.
It is an arithmetic number, because the mean of its divisors is an integer number (339930591).
Almost surely, 22688474989 is an apocalyptic number.
It is an amenable number.
2688474989 is a deficient number, since it is larger than the sum of its proper divisors (30969739).
2688474989 is an equidigital number, since it uses as much as digits as its factorization.
2688474989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33295.
The product of its digits is 55738368, while the sum is 65.
The square root of 2688474989 is about 51850.5061595352. The cubic root of 2688474989 is about 1390.4925516638.
The spelling of 2688474989 in words is "two billion, six hundred eighty-eight million, four hundred seventy-four thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •