1450505672 has 128 divisors (see below), whose sum is σ = 3635159040. Its totient is φ = 525761280.

The previous prime is 1450505669. The next prime is 1450505677. The reversal of 1450505672 is 2765050541.

It is an alternating number because its digits alternate between odd and even.

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

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

Almost surely, 2^1450505672 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 42000, while the sum is 35.

The square root of 1450505672 is about 38085.5047491825. The cubic root of 1450505672 is about 1131.9827543394.

The spelling of 1450505672 in words is "one billion, four hundred fifty million, five hundred five thousand, six hundred seventy-two".