Base | Representation |
---|---|
bin | 101111110110000010001101… |
… | …111111101010010101110101 |
3 | 1000121001002110120000112111021 |
4 | 233312002031333222111311 |
5 | 210040021032012312324 |
6 | 2023310133232341141 |
7 | 62215305643144021 |
oct | 5766021577522565 |
9 | 1017032416015437 |
10 | 210421420041589 |
11 | 6105724aa35a79 |
12 | 1b7250b79a47b1 |
13 | 90548686a8153 |
14 | 39d6645a49381 |
15 | 194d826149ae4 |
hex | bf608dfea575 |
210421420041589 has 2 divisors, whose sum is σ = 210421420041590. Its totient is φ = 210421420041588.
The previous prime is 210421420041583. The next prime is 210421420041601. The reversal of 210421420041589 is 985140024124012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137260203956100 + 73161216085489 = 11715810^2 + 8553433^2 .
It is a cyclic number.
It is not a de Polignac number, because 210421420041589 - 235 = 210387060303221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210421420041583) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105210710020794 + 105210710020795.
It is an arithmetic number, because the mean of its divisors is an integer number (105210710020795).
Almost surely, 2210421420041589 is an apocalyptic number.
It is an amenable number.
210421420041589 is a deficient number, since it is larger than the sum of its proper divisors (1).
210421420041589 is an equidigital number, since it uses as much as digits as its factorization.
210421420041589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 43.
The spelling of 210421420041589 in words is "two hundred ten trillion, four hundred twenty-one billion, four hundred twenty million, forty-one thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •