Base | Representation |
---|---|
bin | 110000110010001011111101… |
… | …110111101101100000100001 |
3 | 1001010200021002201111011021202 |
4 | 300302023331313231200201 |
5 | 211110232223204404403 |
6 | 2040153122023130545 |
7 | 63123043201163666 |
oct | 6062137567554041 |
9 | 1033607081434252 |
10 | 214555055544353 |
11 | 62400319463807 |
12 | 20092259ba3a55 |
13 | 92945bb609074 |
14 | 3ada73d205a6d |
15 | 19c11091de688 |
hex | c322fdded821 |
214555055544353 has 2 divisors, whose sum is σ = 214555055544354. Its totient is φ = 214555055544352.
The previous prime is 214555055544299. The next prime is 214555055544409. The reversal of 214555055544353 is 353445550555412.
It is an a-pointer prime, because the next prime (214555055544409) can be obtained adding 214555055544353 to its sum of digits (56).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 159481335902464 + 55073719641889 = 12628592^2 + 7421167^2 .
It is a cyclic number.
It is not a de Polignac number, because 214555055544353 - 26 = 214555055544289 is a prime.
It is not a weakly prime, because it can be changed into another prime (214555055546353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107277527772176 + 107277527772177.
It is an arithmetic number, because the mean of its divisors is an integer number (107277527772177).
Almost surely, 2214555055544353 is an apocalyptic number.
It is an amenable number.
214555055544353 is a deficient number, since it is larger than the sum of its proper divisors (1).
214555055544353 is an equidigital number, since it uses as much as digits as its factorization.
214555055544353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90000000, while the sum is 56.
The spelling of 214555055544353 in words is "two hundred fourteen trillion, five hundred fifty-five billion, fifty-five million, five hundred forty-four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •