Search a number
-
+
133672129612800 = 21035264712892087
BaseRepresentation
bin11110011001001011110111…
…110011010100110000000000
3122112021221010112201121010220
4132121023313303110300000
5120010041010140102200
61152144043435423040
740104330661334112
oct3631136763246000
9575257115647126
10133672129612800
1139657039383149
1212baa6798b4a80
1359782c644573c
142501aa0b093b2
15106c1bb1d24a0
hex7992f7cd4c00

133672129612800 has 528 divisors, whose sum is σ = 443031634874880. Its totient is φ = 35546155581440.

The previous prime is 133672129612759. The next prime is 133672129612817. The reversal of 133672129612800 is 8216921276331.

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 47 ways as a sum of consecutive naturals, for example, 64049893357 + ... + 64049895443.

Almost surely, 2133672129612800 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1306368, while the sum is 51.

The spelling of 133672129612800 in words is "one hundred thirty-three trillion, six hundred seventy-two billion, one hundred twenty-nine million, six hundred twelve thousand, eight hundred".