Search a number
-
+
14532672000 = 29353711983
BaseRepresentation
bin11011000100011011…
…01111101000000000
31101111210210020012010
431202031233220000
5214230331001000
610402021332520
71023063450060
oct154215575000
941453706163
1014532672000
116188350630
122996b67140
1314a7a93202
149bc1353a0
155a0ca1d50
hex36236fa00

14532672000 has 640 divisors, whose sum is σ = 60301283328. Its totient is φ = 3016704000.

The previous prime is 14532671977. The next prime is 14532672043. The reversal of 14532672000 is 27623541.

It is a tau number, because it is divible by the number of its divisors (640).

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

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 214532672000 is an apocalyptic number.

14532672000 is a gapful number since it is divisible by the number (10) 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 14532672000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30150641664).

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

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

14532672000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 10080, while the sum is 30.

The spelling of 14532672000 in words is "fourteen billion, five hundred thirty-two million, six hundred seventy-two thousand".