Base | Representation |
---|---|
bin | 1111101000100… |
… | …11011100001110 |
3 | 100010210012012210 |
4 | 13310103130032 |
5 | 232033323010 |
6 | 21003011250 |
7 | 3151525161 |
oct | 764233416 |
9 | 303705183 |
10 | 131151630 |
11 | 68039185 |
12 | 37b09b26 |
13 | 2122ca1c |
14 | 135bdad8 |
15 | b7a9b20 |
hex | 7d1370e |
131151630 has 64 divisors (see below), whose sum is σ = 328458240. Its totient is φ = 33473664.
The previous prime is 131151619. The next prime is 131151653. The reversal of 131151630 is 36151131.
It is a junction number, because it is equal to n+sod(n) for n = 131151597 and 131151606.
It is a congruent number.
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, 109897 + ... + 111083.
It is an arithmetic number, because the mean of its divisors is an integer number (5132160).
Almost surely, 2131151630 is an apocalyptic number.
131151630 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 131151630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164229120).
131151630 is an abundant number, since it is smaller than the sum of its proper divisors (197306610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131151630 is a wasteful number, since it uses less digits than its factorization.
131151630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1353.
The product of its (nonzero) digits is 270, while the sum is 21.
The square root of 131151630 is about 11452.1452138890. The cubic root of 131151630 is about 508.0711842505.
The spelling of 131151630 in words is "one hundred thirty-one million, one hundred fifty-one thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •