Base | Representation |
---|---|
bin | 110000110110100011011100… |
… | …100010000100111110111101 |
3 | 1001011201221200101201221111002 |
4 | 300312203130202010332331 |
5 | 211130141313321422213 |
6 | 2040543031314540045 |
7 | 63153525521342624 |
oct | 6066433442047675 |
9 | 1034657611657432 |
10 | 214855143935933 |
11 | 625066115429a6 |
12 | 20120448b97625 |
13 | 92b69a3845787 |
14 | 3b0b089d966bb |
15 | 19c8d1e50d658 |
hex | c368dc884fbd |
214855143935933 has 2 divisors, whose sum is σ = 214855143935934. Its totient is φ = 214855143935932.
The previous prime is 214855143935903. The next prime is 214855143936029. The reversal of 214855143935933 is 339539341558412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211368476559289 + 3486667376644 = 14538517^2 + 1867262^2 .
It is a cyclic number.
It is not a de Polignac number, because 214855143935933 - 26 = 214855143935869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 214855143935933.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214855143935903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107427571967966 + 107427571967967.
It is an arithmetic number, because the mean of its divisors is an integer number (107427571967967).
Almost surely, 2214855143935933 is an apocalyptic number.
It is an amenable number.
214855143935933 is a deficient number, since it is larger than the sum of its proper divisors (1).
214855143935933 is an equidigital number, since it uses as much as digits as its factorization.
214855143935933 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 209952000, while the sum is 65.
The spelling of 214855143935933 in words is "two hundred fourteen trillion, eight hundred fifty-five billion, one hundred forty-three million, nine hundred thirty-five thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •