Base | Representation |
---|---|
bin | 1001111001010110… |
… | …0111111111111101 |
3 | 20212010121121101100 |
4 | 2132111213333331 |
5 | 20420024001424 |
6 | 1115333203313 |
7 | 122554420356 |
oct | 23625477775 |
9 | 6763547340 |
10 | 2656468989 |
11 | 1143564519 |
12 | 621790539 |
13 | 334484955 |
14 | 1b2b40d2d |
15 | 108336dc9 |
hex | 9e567ffd |
2656468989 has 12 divisors (see below), whose sum is σ = 3837683772. Its totient is φ = 1770720000.
The previous prime is 2656468979. The next prime is 2656468993. The reversal of 2656468989 is 9898646562.
2656468989 is a `hidden beast` number, since 2 + 6 + 564 + 68 + 9 + 8 + 9 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 800324100 + 1856144889 = 28290^2 + 43083^2 .
It is not a de Polignac number, because 2656468989 - 28 = 2656468733 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2656468939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 59149 + ... + 93869.
It is an arithmetic number, because the mean of its divisors is an integer number (319806981).
Almost surely, 22656468989 is an apocalyptic number.
It is an amenable number.
2656468989 is a deficient number, since it is larger than the sum of its proper divisors (1181214783).
2656468989 is a wasteful number, since it uses less digits than its factorization.
2656468989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43228 (or 43225 counting only the distinct ones).
The product of its digits is 44789760, while the sum is 63.
The square root of 2656468989 is about 51540.9447817946. The cubic root of 2656468989 is about 1384.9526219419.
The spelling of 2656468989 in words is "two billion, six hundred fifty-six million, four hundred sixty-eight thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •