Base | Representation |
---|---|
bin | 101111110110010011010101… |
… | …101110011000000111010101 |
3 | 1000121002211220201102211000112 |
4 | 233312103111232120013111 |
5 | 210040321204123323341 |
6 | 2023322413330252405 |
7 | 62216526334454651 |
oct | 5766232556300725 |
9 | 1017084821384015 |
10 | 210439803339221 |
11 | 61064023915635 |
12 | 1b728788427105 |
13 | 905650814c861 |
14 | 39d74ab32da61 |
15 | 194e04eeb7aeb |
hex | bf64d5b981d5 |
210439803339221 has 2 divisors, whose sum is σ = 210439803339222. Its totient is φ = 210439803339220.
The previous prime is 210439803339211. The next prime is 210439803339253. The reversal of 210439803339221 is 122933308934012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 189109390407025 + 21330412932196 = 13751705^2 + 4618486^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210439803339221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210439803339221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210439803339211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105219901669610 + 105219901669611.
It is an arithmetic number, because the mean of its divisors is an integer number (105219901669611).
Almost surely, 2210439803339221 is an apocalyptic number.
It is an amenable number.
210439803339221 is a deficient number, since it is larger than the sum of its proper divisors (1).
210439803339221 is an equidigital number, since it uses as much as digits as its factorization.
210439803339221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1679616, while the sum is 50.
The spelling of 210439803339221 in words is "two hundred ten trillion, four hundred thirty-nine billion, eight hundred three million, three hundred thirty-nine thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •