Base | Representation |
---|---|
bin | 110000101010100110111001… |
… | …101001111010100011111101 |
3 | 1001001211110201210120212110202 |
4 | 300222212321221322203331 |
5 | 211023214040312044201 |
6 | 2035113544022413245 |
7 | 63040314333326132 |
oct | 6052467151724375 |
9 | 1031743653525422 |
10 | 214034220034301 |
11 | 6221a448392217 |
12 | 20009323291225 |
13 | 9257456979824 |
14 | 3abd450b6a589 |
15 | 19b27c4301c6b |
hex | c2a9b9a7a8fd |
214034220034301 has 2 divisors, whose sum is σ = 214034220034302. Its totient is φ = 214034220034300.
The previous prime is 214034220034289. The next prime is 214034220034373. The reversal of 214034220034301 is 103430022430412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131792718970201 + 82241501064100 = 11480101^2 + 9068710^2 .
It is a cyclic number.
It is not a de Polignac number, because 214034220034301 - 26 = 214034220034237 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214034220034391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107017110017150 + 107017110017151.
It is an arithmetic number, because the mean of its divisors is an integer number (107017110017151).
Almost surely, 2214034220034301 is an apocalyptic number.
It is an amenable number.
214034220034301 is a deficient number, since it is larger than the sum of its proper divisors (1).
214034220034301 is an equidigital number, since it uses as much as digits as its factorization.
214034220034301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13824, while the sum is 29.
Adding to 214034220034301 its reverse (103430022430412), we get a palindrome (317464242464713).
The spelling of 214034220034301 in words is "two hundred fourteen trillion, thirty-four billion, two hundred twenty million, thirty-four thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •