Search a number
-
+
61126213 is a prime number
BaseRepresentation
bin1110100100101…
…1011001000101
311021000112101211
43221023121011
5111122014323
610022051421
71341364351
oct351133105
9137015354
1061126213
1131560035
1218579b71
13c882775
148192461
15557670d
hex3a4b645

61126213 has 2 divisors, whose sum is σ = 61126214. Its totient is φ = 61126212.

The previous prime is 61126193. The next prime is 61126231. The reversal of 61126213 is 31262116.

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

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 56295009 + 4831204 = 7503^2 + 2198^2 .

It is a cyclic number.

It is not a de Polignac number, because 61126213 - 225 = 27571781 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (61126913) 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, 30563106 + 30563107.

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

Almost surely, 261126213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 432, while the sum is 22.

The square root of 61126213 is about 7818.3254600969. The cubic root of 61126213 is about 393.9210269711.

Adding to 61126213 its reverse (31262116), we get a palindrome (92388329).

The spelling of 61126213 in words is "sixty-one million, one hundred twenty-six thousand, two hundred thirteen".