10574856901 has 16 divisors (see below), whose sum is σ = 12614344704. Its totient is φ = 8667776304.

The previous prime is 10574856893. The next prime is 10574856911. The reversal of 10574856901 is 10965847501.

10574856901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is not a de Polignac number, because 10574856901 - 2³ = 10574856893 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10574856911) 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 in 15 ways as a sum of consecutive naturals, for example, 889740 + ... + 901546.

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

Almost surely, 2^10574856901 is an apocalyptic number.

It is an amenable number.

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

10574856901 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 17400.

The product of its (nonzero) digits is 302400, while the sum is 46.

The spelling of 10574856901 in words is "ten billion, five hundred seventy-four million, eight hundred fifty-six thousand, nine hundred one".