126601272 has 256 divisors, whose sum is σ = 431923200. Its totient is φ = 33592320.

The previous prime is 126601271. The next prime is 126601273. The reversal of 126601272 is 272106621.

It is an interprime number because it is at equal distance from previous prime (126601271) and next prime (126601273).

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 (126601271) by changing a digit.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1734228 + ... + 1734300.

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

Almost surely, 2^126601272 is an apocalyptic number.

126601272 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 126601272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (215961600).

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

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

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

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

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

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

The square root of 126601272 is about 11251.7230680461. The cubic root of 126601272 is about 502.1259769653.

Adding to 126601272 its reverse (272106621), we get a palindrome (398707893).

The spelling of 126601272 in words is "one hundred twenty-six million, six hundred one thousand, two hundred seventy-two".