Base | Representation |
---|---|
bin | 111011000000010… |
… | …111010001011101 |
3 | 2112222202201120102 |
4 | 323000113101131 |
5 | 4011411413234 |
6 | 242122030445 |
7 | 33350305502 |
oct | 7300272135 |
9 | 2488681512 |
10 | 989951069 |
11 | 46888a988 |
12 | 237648425 |
13 | 12a12c283 |
14 | 956934a9 |
15 | 5bd98c7e |
hex | 3b01745d |
989951069 has 2 divisors, whose sum is σ = 989951070. Its totient is φ = 989951068.
The previous prime is 989951059. The next prime is 989951071. The reversal of 989951069 is 960159989.
989951069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 666310969 + 323640100 = 25813^2 + 17990^2 .
It is a cyclic number.
It is not a de Polignac number, because 989951069 - 28 = 989950813 is a prime.
It is a super-2 number, since 2×9899510692 = 1960006238028485522, which contains 22 as substring.
Together with 989951071, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (989951059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 494975534 + 494975535.
It is an arithmetic number, because the mean of its divisors is an integer number (494975535).
Almost surely, 2989951069 is an apocalyptic number.
It is an amenable number.
989951069 is a deficient number, since it is larger than the sum of its proper divisors (1).
989951069 is an equidigital number, since it uses as much as digits as its factorization.
989951069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1574640, while the sum is 56.
The square root of 989951069 is about 31463.4878708639. The cubic root of 989951069 is about 996.6390731589.
The spelling of 989951069 in words is "nine hundred eighty-nine million, nine hundred fifty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •