Search a number
-
+
1012147 is a prime number
BaseRepresentation
bin11110111000110110011
31220102101221
43313012303
5224342042
633405511
711413603
oct3670663
91812357
101012147
11631494
12409897
13295906
141c4c03
1514ed67
hexf71b3

1012147 has 2 divisors, whose sum is σ = 1012148. Its totient is φ = 1012146.

The previous prime is 1012133. The next prime is 1012159. The reversal of 1012147 is 7412101.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1012147 - 215 = 979379 is a prime.

It is a super-3 number, since 3×10121473 = 3110656323336301569, which contains 333 as substring.

It is an alternating number because its digits alternate between odd and even.

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

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

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

21012147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56, while the sum is 16.

The square root of 1012147 is about 1006.0551674734. The cubic root of 1012147 is about 100.4032715346.

Adding to 1012147 its reverse (7412101), we get a palindrome (8424248).

The spelling of 1012147 in words is "one million, twelve thousand, one hundred forty-seven".