Search a number
-
+
1012142313437 is a prime number
BaseRepresentation
bin11101011101010000110…
…00100000111111011101
310120202111221022212011112
432232220120200333131
5113040331413012222
62052545522231405
7133060554466523
oct16565030407735
93522457285145
101012142313437
11360279a49782
121441b04b5565
13745a1a6a6a8
1436db8d0c313
151b4dc748be2
hexeba8620fdd

1012142313437 has 2 divisors, whose sum is σ = 1012142313438. Its totient is φ = 1012142313436.

The previous prime is 1012142313409. The next prime is 1012142313439. The reversal of 1012142313437 is 7343132412101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1005950826841 + 6191486596 = 1002971^2 + 78686^2 .

It is a cyclic number.

It is not a de Polignac number, because 1012142313437 - 218 = 1012142051293 is a prime.

It is a super-3 number, since 3×10121423134373 (a number of 37 digits) contains 333 as substring.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21012142313437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 32.

Adding to 1012142313437 its reverse (7343132412101), we get a palindrome (8355274725538).

The spelling of 1012142313437 in words is "one trillion, twelve billion, one hundred forty-two million, three hundred thirteen thousand, four hundred thirty-seven".