Base | Representation |
---|---|
bin | 110000101101010011111010… |
… | …110110111010010101001101 |
3 | 1001002111020020221202200210101 |
4 | 300231103322312322111031 |
5 | 211034240023333211442 |
6 | 2035335150331411101 |
7 | 63056612145231031 |
oct | 6055237266722515 |
9 | 1032436227680711 |
10 | 214219997553997 |
11 | 62291210a08466 |
12 | 2003932b8b3a91 |
13 | 926bb22561486 |
14 | 3ac8435dc01c1 |
15 | 19b7548d47cb7 |
hex | c2d4fadba54d |
214219997553997 has 2 divisors, whose sum is σ = 214219997553998. Its totient is φ = 214219997553996.
The previous prime is 214219997553949. The next prime is 214219997554009. The reversal of 214219997553997 is 799355799912412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 205430130471556 + 8789867082441 = 14332834^2 + 2964771^2 .
It is a cyclic number.
It is not a de Polignac number, because 214219997553997 - 211 = 214219997551949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 214219997553997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (214219997550997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107109998776998 + 107109998776999.
It is an arithmetic number, because the mean of its divisors is an integer number (107109998776999).
Almost surely, 2214219997553997 is an apocalyptic number.
It is an amenable number.
214219997553997 is a deficient number, since it is larger than the sum of its proper divisors (1).
214219997553997 is an equidigital number, since it uses as much as digits as its factorization.
214219997553997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3472081200, while the sum is 82.
The spelling of 214219997553997 in words is "two hundred fourteen trillion, two hundred nineteen billion, nine hundred ninety-seven million, five hundred fifty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •