Base | Representation |
---|---|
bin | 101111101111101011100110… |
… | …101110110011110011011101 |
3 | 1000112111100112022000201121001 |
4 | 233233223212232303303131 |
5 | 210010342403431210213 |
6 | 2022333410124110301 |
7 | 62141621434143652 |
oct | 5757534656636335 |
9 | 1015440468021531 |
10 | 209984822131933 |
11 | 609a9076889452 |
12 | 1b674570095391 |
13 | 9022639a92984 |
14 | 39bd46906bc29 |
15 | 19422c17861dd |
hex | befae6bb3cdd |
209984822131933 has 2 divisors, whose sum is σ = 209984822131934. Its totient is φ = 209984822131932.
The previous prime is 209984822131927. The next prime is 209984822131939. The reversal of 209984822131933 is 339131228489902.
It is a balanced prime because it is at equal distance from previous prime (209984822131927) and next prime (209984822131939).
It can be written as a sum of positive squares in only one way, i.e., 202498677421209 + 7486144710724 = 14230203^2 + 2736082^2 .
It is a cyclic number.
It is not a de Polignac number, because 209984822131933 - 229 = 209984285261021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (209984822131939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 104992411065966 + 104992411065967.
It is an arithmetic number, because the mean of its divisors is an integer number (104992411065967).
Almost surely, 2209984822131933 is an apocalyptic number.
It is an amenable number.
209984822131933 is a deficient number, since it is larger than the sum of its proper divisors (1).
209984822131933 is an equidigital number, since it uses as much as digits as its factorization.
209984822131933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40310784, while the sum is 64.
The spelling of 209984822131933 in words is "two hundred nine trillion, nine hundred eighty-four billion, eight hundred twenty-two million, one hundred thirty-one thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •