Base | Representation |
---|---|
bin | 1111101000100… |
… | …11010011000000 |
3 | 100010210011101221 |
4 | 13310103103000 |
5 | 232033313130 |
6 | 21003004424 |
7 | 3151523356 |
oct | 764232300 |
9 | 303704357 |
10 | 131151040 |
11 | 68038799 |
12 | 37b09714 |
13 | 2122c687 |
14 | 135bd7d6 |
15 | b7a987a |
hex | 7d134c0 |
131151040 has 56 divisors (see below), whose sum is σ = 313822080. Its totient is φ = 52205568.
The previous prime is 131151017. The next prime is 131151047. The reversal of 131151040 is 40151131.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131151047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73681 + ... + 75439.
Almost surely, 2131151040 is an apocalyptic number.
131151040 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 131151040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156911040).
131151040 is an abundant number, since it is smaller than the sum of its proper divisors (182671040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131151040 is a wasteful number, since it uses less digits than its factorization.
131151040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2009 (or 1999 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 131151040 is about 11452.1194544940. The cubic root of 131151040 is about 508.0704223780.
Subtracting from 131151040 its reverse (40151131), we obtain a palindrome (90999909).
The spelling of 131151040 in words is "one hundred thirty-one million, one hundred fifty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •