Base | Representation |
---|---|
bin | 10010011100100011… |
… | …01100011101010101 |
3 | 221120011121110222122 |
4 | 21032101230131111 |
5 | 130240204232424 |
6 | 4314403505325 |
7 | 500260530341 |
oct | 111621543525 |
9 | 27504543878 |
10 | 9903195989 |
11 | 42221067a5 |
12 | 1b04688245 |
13 | c1a9255ab |
14 | 69d364621 |
15 | 3ce63a45e |
hex | 24e46c755 |
9903195989 has 2 divisors, whose sum is σ = 9903195990. Its totient is φ = 9903195988.
The previous prime is 9903195901. The next prime is 9903196001. The reversal of 9903195989 is 9895913099.
9903195989 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., 8595144100 + 1308051889 = 92710^2 + 36167^2 .
It is a cyclic number.
It is not a de Polignac number, because 9903195989 - 28 = 9903195733 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (9903195089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4951597994 + 4951597995.
It is an arithmetic number, because the mean of its divisors is an integer number (4951597995).
Almost surely, 29903195989 is an apocalyptic number.
It is an amenable number.
9903195989 is a deficient number, since it is larger than the sum of its proper divisors (1).
9903195989 is an equidigital number, since it uses as much as digits as its factorization.
9903195989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7085880, while the sum is 62.
The square root of 9903195989 is about 99514.8028636946. The cubic root of 9903195989 is about 2147.4602054657.
The spelling of 9903195989 in words is "nine billion, nine hundred three million, one hundred ninety-five thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •