10145366500651 has 4 divisors (see below), whose sum is σ = 10679333158600. Its totient is φ = 9611399842704.

The previous prime is 10145366500649. The next prime is 10145366500663. The reversal of 10145366500651 is 15600566354101.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 10145366500651 - 2¹ = 10145366500649 is a prime.

It is a super-2 number, since 2×10145366500651² (a number of 27 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (10145366500151) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 266983328946 + ... + 266983328983.

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

Almost surely, 2^{10145366500651} is an apocalyptic number.

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

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

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

The sum of its prime factors is 533966657948.

The product of its (nonzero) digits is 324000, while the sum is 43.

The spelling of 10145366500651 in words is "ten trillion, one hundred forty-five billion, three hundred sixty-six million, five hundred thousand, six hundred fifty-one".