Search a number
-
+
214693813 is a prime number
BaseRepresentation
bin11001100101111…
…11011110110101
3112221222120112201
430302333132311
5414430200223
633145344501
75214603325
oct1462773665
9487876481
10214693813
11100209704
125ba98131
1335630479
1420729285
1513cacead
hexccbf7b5

214693813 has 2 divisors, whose sum is σ = 214693814. Its totient is φ = 214693812.

The previous prime is 214693811. The next prime is 214693819. The reversal of 214693813 is 318396412.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 118222129 + 96471684 = 10873^2 + 9822^2 .

It is a cyclic number.

It is not a de Polignac number, because 214693813 - 21 = 214693811 is a prime.

Together with 214693811, it forms a pair of twin primes.

It is equal to p11846188 and since 214693813 and 11846188 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (214693811) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 107346906 + 107346907.

It is an arithmetic number, because the mean of its divisors is an integer number (107346907).

Almost surely, 2214693813 is an apocalyptic number.

It is an amenable number.

214693813 is a deficient number, since it is larger than the sum of its proper divisors (1).

214693813 is an equidigital number, since it uses as much as digits as its factorization.

214693813 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 31104, while the sum is 37.

The square root of 214693813 is about 14652.4336886403. The cubic root of 214693813 is about 598.7881214914.

It can be divided in two parts, 2146 and 93813, that added together give a palindrome (95959).

The spelling of 214693813 in words is "two hundred fourteen million, six hundred ninety-three thousand, eight hundred thirteen".