Base | Representation |
---|---|
bin | 1111101100010… |
… | …10000110111010 |
3 | 100011200212222000 |
4 | 13312022012322 |
5 | 232144401230 |
6 | 21021241430 |
7 | 3155621232 |
oct | 766120672 |
9 | 304625860 |
10 | 131637690 |
11 | 68340388 |
12 | 38103276 |
13 | 21370032 |
14 | 136a8cc2 |
15 | b853b60 |
hex | 7d8a1ba |
131637690 has 64 divisors (see below), whose sum is σ = 357696000. Its totient is φ = 34437312.
The previous prime is 131637689. The next prime is 131637721. The reversal of 131637690 is 96736131.
131637690 is a `hidden beast` number, since 13 + 1 + 637 + 6 + 9 + 0 = 666.
It is a super-2 number, since 2×1316376902 = 34656962857072200, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9711 + ... + 18909.
It is an arithmetic number, because the mean of its divisors is an integer number (5589000).
Almost surely, 2131637690 is an apocalyptic number.
131637690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 131637690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178848000).
131637690 is an abundant number, since it is smaller than the sum of its proper divisors (226058310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131637690 is a wasteful number, since it uses less digits than its factorization.
131637690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9268 (or 9262 counting only the distinct ones).
The product of its (nonzero) digits is 20412, while the sum is 36.
The square root of 131637690 is about 11473.3469397556. The cubic root of 131637690 is about 508.6980633050.
The spelling of 131637690 in words is "one hundred thirty-one million, six hundred thirty-seven thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •