Base | Representation |
---|---|
bin | 111001110100001… |
… | …100001010111001 |
3 | 2111121012020001022 |
4 | 321310030022321 |
5 | 3441303421044 |
6 | 240130032225 |
7 | 33015500516 |
oct | 7164141271 |
9 | 2447166038 |
10 | 969982649 |
11 | 458591359 |
12 | 230a18675 |
13 | 125c5a33c |
14 | 92b7630d |
15 | 5a2523ee |
hex | 39d0c2b9 |
969982649 has 2 divisors, whose sum is σ = 969982650. Its totient is φ = 969982648.
The previous prime is 969982631. The next prime is 969982669. The reversal of 969982649 is 946289969.
969982649 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 842857024 + 127125625 = 29032^2 + 11275^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-969982649 is a prime.
It is a super-2 number, since 2×9699826492 = 1881732678722114402, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 969982591 and 969982600.
It is not a weakly prime, because it can be changed into another prime (969982669) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 484991324 + 484991325.
It is an arithmetic number, because the mean of its divisors is an integer number (484991325).
Almost surely, 2969982649 is an apocalyptic number.
It is an amenable number.
969982649 is a deficient number, since it is larger than the sum of its proper divisors (1).
969982649 is an equidigital number, since it uses as much as digits as its factorization.
969982649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15116544, while the sum is 62.
The square root of 969982649 is about 31144.5444500317. The cubic root of 969982649 is about 989.8923969028.
The spelling of 969982649 in words is "nine hundred sixty-nine million, nine hundred eighty-two thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •