Base | Representation |
---|---|
bin | 1111100111100… |
… | …01110111001100 |
3 | 100010112012112210 |
4 | 13303301313030 |
5 | 232014422332 |
6 | 21000030420 |
7 | 3150413166 |
oct | 763616714 |
9 | 303465483 |
10 | 131014092 |
11 | 67a54910 |
12 | 37a62410 |
13 | 211b2241 |
14 | 13585936 |
15 | b77decc |
hex | 7cf1dcc |
131014092 has 96 divisors (see below), whose sum is σ = 346477824. Its totient is φ = 38188800.
The previous prime is 131014073. The next prime is 131014097. The reversal of 131014092 is 290410131.
It is not an unprimeable number, because it can be changed into a prime (131014097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 426603 + ... + 426909.
It is an arithmetic number, because the mean of its divisors is an integer number (3609144).
Almost surely, 2131014092 is an apocalyptic number.
131014092 is a gapful number since it is divisible by the number (12) 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 131014092, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173238912).
131014092 is an abundant number, since it is smaller than the sum of its proper divisors (215463732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131014092 is a wasteful number, since it uses less digits than its factorization.
131014092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439 (or 437 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 131014092 is about 11446.1387375831. The cubic root of 131014092 is about 507.8935183024.
The spelling of 131014092 in words is "one hundred thirty-one million, fourteen thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •