Search a number
-
+
133056775488 = 263713293143197
BaseRepresentation
bin111101111101011001…
…1010100010101000000
3110201102221210112021210
41323322303110111000
54140000013303423
6141043032250120
712420161634150
oct1737263242500
9421387715253
10133056775488
115147a09886a
1221954540940
13c716277420
146623450760
1536db3beb93
hex1efacd4540

133056775488 has 896 divisors, whose sum is σ = 475850833920. Its totient is φ = 31863767040.

The previous prime is 133056775469. The next prime is 133056775513. The reversal of 133056775488 is 884577650331.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 675415006 + ... + 675415202.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 16934400, while the sum is 57.

The spelling of 133056775488 in words is "one hundred thirty-three billion, fifty-six million, seven hundred seventy-five thousand, four hundred eighty-eight".