572146536 has 32 divisors (see below), whose sum is σ = 1540395360. Its totient is φ = 176044992.

The previous prime is 572146499. The next prime is 572146537. The reversal of 572146536 is 635641275.

It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.

It is a Harshad number since it is a multiple of its sum of digits (39).

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 916590 + ... + 917213.

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

Almost surely, 2^572146536 is an apocalyptic number.

It is an amenable number.

572146536 is an abundant number, since it is smaller than the sum of its proper divisors (968248824).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its digits is 151200, while the sum is 39.

The square root of 572146536 is about 23919.5847790048. The cubic root of 572146536 is about 830.1739297761.

The spelling of 572146536 in words is "five hundred seventy-two million, one hundred forty-six thousand, five hundred thirty-six".