Base | Representation |
---|---|
bin | 1011111100100000010101 |
3 | 12220002111021 |
4 | 23330200111 |
5 | 1300201123 |
6 | 151041141 |
7 | 35421325 |
oct | 13744025 |
9 | 5802437 |
10 | 3131413 |
11 | 184974a |
12 | 10701b1 |
13 | 85840c |
14 | 5b7285 |
15 | 41cc5d |
hex | 2fc815 |
3131413 has 4 divisors (see below), whose sum is σ = 3136140. Its totient is φ = 3126688.
The previous prime is 3131377. The next prime is 3131419. The reversal of 3131413 is 3141313.
3131413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 935089 + 2196324 = 967^2 + 1482^2 .
It is a cyclic number.
It is not a de Polignac number, because 3131413 - 29 = 3130901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3131419) 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 3 ways as a sum of consecutive naturals, for example, 1168 + ... + 2761.
It is an arithmetic number, because the mean of its divisors is an integer number (784035).
Almost surely, 23131413 is an apocalyptic number.
It is an amenable number.
3131413 is a deficient number, since it is larger than the sum of its proper divisors (4727).
3131413 is an equidigital number, since it uses as much as digits as its factorization.
3131413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4726.
The product of its digits is 108, while the sum is 16.
The square root of 3131413 is about 1769.5798936471. The cubic root of 3131413 is about 146.3008277809.
Adding to 3131413 its reverse (3141313), we get a palindrome (6272726).
The spelling of 3131413 in words is "three million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •