Base | Representation |
---|---|
bin | 1111100111111… |
… | …11000011111000 |
3 | 100010121221201000 |
4 | 13303333003320 |
5 | 232023140102 |
6 | 21001125000 |
7 | 3151026615 |
oct | 763770370 |
9 | 303557630 |
10 | 131068152 |
11 | 67a91496 |
12 | 37a89760 |
13 | 21200a27 |
14 | 1359b50c |
15 | b79001c |
hex | 7cff0f8 |
131068152 has 96 divisors (see below), whose sum is σ = 374446800. Its totient is φ = 42464448.
The previous prime is 131068141. The next prime is 131068159. The reversal of 131068152 is 251860131.
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 (131068159) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1224883 + ... + 1224989.
Almost surely, 2131068152 is an apocalyptic number.
131068152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is a pronic number, being equal to 11448×11449.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131068152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187223400).
131068152 is an abundant number, since it is smaller than the sum of its proper divisors (243378648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131068152 is a wasteful number, since it uses less digits than its factorization.
131068152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282 (or 165 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 131068152 is about 11448.4999890815. The cubic root of 131068152 is about 507.9633656182.
The spelling of 131068152 in words is "one hundred thirty-one million, sixty-eight thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •