Base | Representation |
---|---|
bin | 1111101001000… |
… | …10010101000000 |
3 | 100010220021212020 |
4 | 13310202111000 |
5 | 232042300413 |
6 | 21004201440 |
7 | 3152201022 |
oct | 764422500 |
9 | 303807766 |
10 | 131212608 |
11 | 6807aa7a |
12 | 37b39280 |
13 | 212516c7 |
14 | 135d8012 |
15 | b7bcc23 |
hex | 7d22540 |
131212608 has 112 divisors (see below), whose sum is σ = 371222016. Its totient is φ = 40803840.
The previous prime is 131212603. The next prime is 131212621. The reversal of 131212608 is 806212131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131212603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 189543 + ... + 190233.
Almost surely, 2131212608 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131212608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (185611008).
131212608 is an abundant number, since it is smaller than the sum of its proper divisors (240009408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131212608 is a wasteful number, since it uses less digits than its factorization.
131212608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772 (or 762 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 24.
The square root of 131212608 is about 11454.8072004726. The cubic root of 131212608 is about 508.1499133887.
Adding to 131212608 its reverse (806212131), we get a palindrome (937424739).
The spelling of 131212608 in words is "one hundred thirty-one million, two hundred twelve thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •