Base | Representation |
---|---|
bin | 10000010000100011110011 |
3 | 22000112112201 |
4 | 100100203303 |
5 | 2042342011 |
6 | 231204031 |
7 | 51141016 |
oct | 20204363 |
9 | 8015481 |
10 | 4262131 |
11 | 2451225 |
12 | 1516617 |
13 | b62c93 |
14 | 7cd37d |
15 | 592cc1 |
hex | 4108f3 |
4262131 has 8 divisors (see below), whose sum is σ = 4379184. Its totient is φ = 4146720.
The previous prime is 4262119. The next prime is 4262143. The reversal of 4262131 is 1312624.
It is an interprime number because it is at equal distance from previous prime (4262119) and next prime (4262143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4262131 - 27 = 4262003 is a prime.
It is a super-2 number, since 2×42621312 = 36331521322322, which contains 22 as substring.
It is a Duffinian number.
4262131 is a lucky number.
It is a junction number, because it is equal to n+sod(n) for n = 4262099 and 4262108.
It is not an unprimeable number, because it can be changed into a prime (4262161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6201 + ... + 6853.
It is an arithmetic number, because the mean of its divisors is an integer number (547398).
Almost surely, 24262131 is an apocalyptic number.
4262131 is the 1306-th heptagonal number.
4262131 is a deficient number, since it is larger than the sum of its proper divisors (117053).
4262131 is a wasteful number, since it uses less digits than its factorization.
4262131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 821.
The product of its digits is 288, while the sum is 19.
The square root of 4262131 is about 2064.4929159481. The cubic root of 4262131 is about 162.1345602528.
Adding to 4262131 its reverse (1312624), we get a palindrome (5574755).
The spelling of 4262131 in words is "four million, two hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •