Search a number
-
+
7856213 is a prime number
BaseRepresentation
bin11101111110000001010101
3112210010200212
4131332001111
54002344323
6440215205
7123530261
oct35760125
915703625
107856213
114486542
12276a505
131820b61
1410870a1
15a52b78
hex77e055

7856213 has 2 divisors, whose sum is σ = 7856214. Its totient is φ = 7856212.

The previous prime is 7856207. The next prime is 7856231. The reversal of 7856213 is 3126587.

It is a happy number.

7856213 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

Together with next prime (7856231) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6360484 + 1495729 = 2522^2 + 1223^2 .

It is a cyclic number.

It is not a de Polignac number, because 7856213 - 24 = 7856197 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 7856213.

It is a congruent number.

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

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

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

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

Almost surely, 27856213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10080, while the sum is 32.

The square root of 7856213 is about 2802.8936833209. The cubic root of 7856213 is about 198.7945237329.

The spelling of 7856213 in words is "seven million, eight hundred fifty-six thousand, two hundred thirteen".