Search a number
-
+
1012120217 is a prime number
BaseRepresentation
bin111100010100111…
…011101010011001
32121112111000220222
4330110323222121
54033100321332
6244233125425
734036610543
oct7424735231
92545430828
101012120217
1147a351999
12242b59875
131318c1b04
14985c4693
155dcc7712
hex3c53ba99

1012120217 has 2 divisors, whose sum is σ = 1012120218. Its totient is φ = 1012120216.

The previous prime is 1012120201. The next prime is 1012120223. The reversal of 1012120217 is 7120212101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 979126681 + 32993536 = 31291^2 + 5744^2 .

It is an emirp because it is prime and its reverse (7120212101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1012120217 - 24 = 1012120201 is a prime.

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

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

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

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

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

Almost surely, 21012120217 is an apocalyptic number.

It is an amenable number.

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

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

1012120217 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 17.

The square root of 1012120217 is about 31813.8368795718. The cubic root of 1012120217 is about 1004.0238591733.

Adding to 1012120217 its reverse (7120212101), we get a palindrome (8132332318).

The spelling of 1012120217 in words is "one billion, twelve million, one hundred twenty thousand, two hundred seventeen".