Base | Representation |
---|---|
bin | 110101101100001… |
… | …010010110100101 |
3 | 2022202221211000211 |
4 | 311230022112211 |
5 | 3321044103224 |
6 | 225214335421 |
7 | 31215261145 |
oct | 6554122645 |
9 | 2282854024 |
10 | 900769189 |
11 | 422508251 |
12 | 2117ba571 |
13 | 114805828 |
14 | 878ba925 |
15 | 5412e894 |
hex | 35b0a5a5 |
900769189 has 2 divisors, whose sum is σ = 900769190. Its totient is φ = 900769188.
The previous prime is 900769169. The next prime is 900769211. The reversal of 900769189 is 981967009.
900769189 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., 856440225 + 44328964 = 29265^2 + 6658^2 .
It is an emirp because it is prime and its reverse (981967009) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 900769189 - 211 = 900767141 is a prime.
It is a super-2 number, since 2×9007691892 = 1622770263703435442, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (900769169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 450384594 + 450384595.
It is an arithmetic number, because the mean of its divisors is an integer number (450384595).
Almost surely, 2900769189 is an apocalyptic number.
It is an amenable number.
900769189 is a deficient number, since it is larger than the sum of its proper divisors (1).
900769189 is an equidigital number, since it uses as much as digits as its factorization.
900769189 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 244944, while the sum is 49.
The square root of 900769189 is about 30012.8170787082. The cubic root of 900769189 is about 965.7643595489.
The spelling of 900769189 in words is "nine hundred million, seven hundred sixty-nine thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •