10500057151063 has 12 divisors (see below), whose sum is σ = 10695614890408. Its totient is φ = 10308005597520.

The previous prime is 10500057151061. The next prime is 10500057151079. The reversal of 10500057151063 is 36015175000501.

It is not a de Polignac number, because 10500057151063 - 2¹ = 10500057151061 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 494008 + ... + 4609138.

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

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

10500057151063 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 4115982 (or 4115923 counting only the distinct ones).

The product of its (nonzero) digits is 15750, while the sum is 34.

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