Search a number
-
+
1150213 is a prime number
BaseRepresentation
bin100011000110100000101
32011102210111
410120310011
5243301323
640353021
712530251
oct4306405
92142714
101150213
11716199
12475771
133136cc
1421d261
1517ac0d
hex118d05

1150213 has 2 divisors, whose sum is σ = 1150214. Its totient is φ = 1150212.

The previous prime is 1150211. The next prime is 1150217. The reversal of 1150213 is 3120511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1046529 + 103684 = 1023^2 + 322^2 .

It is a cyclic number.

It is not a de Polignac number, because 1150213 - 21 = 1150211 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1150193 and 1150202.

It is a congruent number.

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

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

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

21150213 is an apocalyptic number.

It is an amenable number.

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

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

1150213 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 1150213 is about 1072.4798366403. The cubic root of 1150213 is about 104.7754232621.

Adding to 1150213 its reverse (3120511), we get a palindrome (4270724).

The spelling of 1150213 in words is "one million, one hundred fifty thousand, two hundred thirteen".