10462070137 has 2 divisors, whose sum is σ = 10462070138. Its totient is φ = 10462070136.

The previous prime is 10462070119. The next prime is 10462070173. The reversal of 10462070137 is 73107026401.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8973962361 + 1488107776 = 94731^2 + 38576^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-10462070137 is a prime.

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

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

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

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

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

Almost surely, 2^10462070137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7056, while the sum is 31.

Adding to 10462070137 its reverse (73107026401), we get a palindrome (83569096538).

The spelling of 10462070137 in words is "ten billion, four hundred sixty-two million, seventy thousand, one hundred thirty-seven".