Base | Representation |
---|---|
bin | 110111111011100000110001… |
… | …111000111111011011110101 |
3 | 1012020221200001201210011010121 |
4 | 313323200301320333123311 |
5 | 224220133023210444424 |
6 | 2231054355310451541 |
7 | 102545425216364542 |
oct | 6773406170773365 |
9 | 1166850051704117 |
10 | 245982203999989 |
11 | 71417515462646 |
12 | 23708bba503bb1 |
13 | a73403a0109c2 |
14 | 44a5860605bc9 |
15 | 1d68865734ee4 |
hex | dfb831e3f6f5 |
245982203999989 has 2 divisors, whose sum is σ = 245982203999990. Its totient is φ = 245982203999988.
The previous prime is 245982203999969. The next prime is 245982204000019. The reversal of 245982203999989 is 989999302289542.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 221388955931025 + 24593248068964 = 14879145^2 + 4959158^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-245982203999989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (245982203999969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122991101999994 + 122991101999995.
It is an arithmetic number, because the mean of its divisors is an integer number (122991101999995).
Almost surely, 2245982203999989 is an apocalyptic number.
It is an amenable number.
245982203999989 is a deficient number, since it is larger than the sum of its proper divisors (1).
245982203999989 is an equidigital number, since it uses as much as digits as its factorization.
245982203999989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16325867520, while the sum is 88.
The spelling of 245982203999989 in words is "two hundred forty-five trillion, nine hundred eighty-two billion, two hundred three million, nine hundred ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •