Search a number
-
+
133040664000 = 2633531514079
BaseRepresentation
bin111101111100111010…
…1110110110111000000
3110201101211110222111000
41323321311312313000
54134431402222000
6141041255052000
712416604661656
oct1737165666700
9421354428430
10133040664000
1151470a93a92
122194b071000
13c712b25bba
146621258dd6
1536d9c8b000
hex1ef9d76dc0

133040664000 has 448 divisors, whose sum is σ = 491464396800. Its totient is φ = 35233920000.

The previous prime is 133040663993. The next prime is 133040664041. The reversal of 133040664000 is 466040331.

133040664000 is a `hidden beast` number, since 13 + 3 + 0 + 4 + 0 + 6 + 640 + 0 + 0 = 666.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2133040664000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 133040664000 in words is "one hundred thirty-three billion, forty million, six hundred sixty-four thousand".