Base | Representation |
---|---|
bin | 1111101010100… |
… | …11011001101011 |
3 | 100011021111120210 |
4 | 13311103121223 |
5 | 232120213421 |
6 | 21012352203 |
7 | 3153666030 |
oct | 765233153 |
9 | 304244523 |
10 | 131413611 |
11 | 681a7a9a |
12 | 38015663 |
13 | 212c2044 |
14 | 1364b387 |
15 | b80c576 |
hex | 7d5366b |
131413611 has 8 divisors (see below), whose sum is σ = 200249344. Its totient is φ = 75093480.
The previous prime is 131413531. The next prime is 131413613. The reversal of 131413611 is 116314131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131413611 - 27 = 131413483 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 6257791 = 131413611 / (1 + 3 + 1 + 4 + 1 + 3 + 6 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131413613) 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 7 ways as a sum of consecutive naturals, for example, 3128875 + ... + 3128916.
It is an arithmetic number, because the mean of its divisors is an integer number (25031168).
Almost surely, 2131413611 is an apocalyptic number.
131413611 is a deficient number, since it is larger than the sum of its proper divisors (68835733).
131413611 is an equidigital number, since it uses as much as digits as its factorization.
131413611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6257801.
The product of its digits is 216, while the sum is 21.
The square root of 131413611 is about 11463.5775829363. The cubic root of 131413611 is about 508.4092572313.
Adding to 131413611 its reverse (116314131), we get a palindrome (247727742).
The spelling of 131413611 in words is "one hundred thirty-one million, four hundred thirteen thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •