Base | Representation |
---|---|
bin | 1111101000010… |
… | …00000010010011 |
3 | 100010200211010121 |
4 | 13310020002103 |
5 | 232030324130 |
6 | 21002011111 |
7 | 3151242034 |
oct | 764100223 |
9 | 303624117 |
10 | 131104915 |
11 | 68007077 |
12 | 37aa6a97 |
13 | 21214696 |
14 | 135aaa8b |
15 | b79ad7a |
hex | 7d08093 |
131104915 has 8 divisors (see below), whose sum is σ = 157394448. Its totient is φ = 104838240.
The previous prime is 131104913. The next prime is 131104933. The reversal of 131104915 is 519401131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131104915 - 21 = 131104913 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131104915.
It is not an unprimeable number, because it can be changed into a prime (131104913) 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 7 ways as a sum of consecutive naturals, for example, 11784 + ... + 20026.
It is an arithmetic number, because the mean of its divisors is an integer number (19674306).
Almost surely, 2131104915 is an apocalyptic number.
131104915 is a deficient number, since it is larger than the sum of its proper divisors (26289533).
131104915 is an equidigital number, since it uses as much as digits as its factorization.
131104915 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11429.
The product of its (nonzero) digits is 540, while the sum is 25.
The square root of 131104915 is about 11450.1054580296. The cubic root of 131104915 is about 508.0108536648.
The spelling of 131104915 in words is "one hundred thirty-one million, one hundred four thousand, nine hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •