Base | Representation |
---|---|
bin | 1111100111111… |
… | …11001110000000 |
3 | 100010121222121000 |
4 | 13303333032000 |
5 | 232023200200 |
6 | 21001132000 |
7 | 3151031532 |
oct | 763771600 |
9 | 303558530 |
10 | 131068800 |
11 | 67a91a25 |
12 | 37a8a000 |
13 | 21201105 |
14 | 1359b852 |
15 | b790300 |
hex | 7cff380 |
131068800 has 384 divisors, whose sum is σ = 504655200. Its totient is φ = 33177600.
The previous prime is 131068771. The next prime is 131068807. The reversal of 131068800 is 8860131.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a zygodrome in base 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131068807) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3196780 + ... + 3196820.
Almost surely, 2131068800 is an apocalyptic number.
131068800 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 131068800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252327600).
131068800 is an abundant number, since it is smaller than the sum of its proper divisors (373586400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131068800 is a wasteful number, since it uses less digits than its factorization.
131068800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111 (or 88 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 131068800 is about 11448.5282896973. The cubic root of 131068800 is about 507.9642027393.
The spelling of 131068800 in words is "one hundred thirty-one million, sixty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •