Base | Representation |
---|---|
bin | 111101011100110111… |
… | …0010000000000000000 |
3 | 110121121212021221002221 |
4 | 1322321232100000000 |
5 | 4130231010144000 |
6 | 140342430220424 |
7 | 12351133244263 |
oct | 1727156200000 |
9 | 417555257087 |
10 | 131964928000 |
11 | 50a69841674 |
12 | 216aa954714 |
13 | c5a0cbc419 |
14 | 655c434cda |
15 | 36755e961a |
hex | 1eb9b90000 |
131964928000 has 272 divisors, whose sum is σ = 334923104880. Its totient is φ = 51904512000.
The previous prime is 131964927931. The next prime is 131964928001. The reversal of 131964928000 is 829469131.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 106036199424 + 25928728576 = 325632^2 + 161024^2 .
It is not an unprimeable number, because it can be changed into a prime (131964928001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 729087910 + ... + 729088090.
Almost surely, 2131964928000 is an apocalyptic number.
131964928000 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 131964928000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167461552440).
131964928000 is an abundant number, since it is smaller than the sum of its proper divisors (202958176880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131964928000 is an frugal number, since it uses more digits than its factorization.
131964928000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 317 (or 277 counting only the distinct ones).
The product of its (nonzero) digits is 93312, while the sum is 43.
The spelling of 131964928000 in words is "one hundred thirty-one billion, nine hundred sixty-four million, nine hundred twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •