105714072 has 160 divisors (see below), whose sum is σ = 318336480. Its totient is φ = 32693760.

The previous prime is 105714067. The next prime is 105714073. The reversal of 105714072 is 270417501.

It is a super-2 number, since 2×105714072² = 22350930037642368, which contains 22 as substring.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (105714073) 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 39 ways as a sum of consecutive naturals, for example, 610978 + ... + 611150.

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

Almost surely, 2^105714072 is an apocalyptic number.

105714072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 105714072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159168240).

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

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

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

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

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

The product of its (nonzero) digits is 1960, while the sum is 27.

The square root of 105714072 is about 10281.7348730650. The cubic root of 105714072 is about 472.8364346165.

It can be divided in two parts, 1057 and 14072, that added together give a square (15129 = 123²).

The spelling of 105714072 in words is "one hundred five million, seven hundred fourteen thousand, seventy-two".