Base | Representation |
---|---|
bin | 101100110001… |
… | …111111111011 |
3 | 211002102001122 |
4 | 230301333323 |
5 | 11001123011 |
6 | 1055335455 |
7 | 201531605 |
oct | 54617773 |
9 | 24072048 |
10 | 11739131 |
11 | 6698868 |
12 | 3b2158b |
13 | 2580341 |
14 | 17b8175 |
15 | 106d3db |
hex | b31ffb |
11739131 has 8 divisors (see below), whose sum is σ = 12894720. Its totient is φ = 10637352.
The previous prime is 11739107. The next prime is 11739149. The reversal of 11739131 is 13193711.
11739131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 11739131 - 210 = 11738107 is a prime.
It is a super-2 number, since 2×117391312 = 275614393270322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11739131.
It is not an unprimeable number, because it can be changed into a prime (11739181) 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, 12995 + ... + 13868.
It is an arithmetic number, because the mean of its divisors is an integer number (1611840).
Almost surely, 211739131 is an apocalyptic number.
11739131 is a deficient number, since it is larger than the sum of its proper divisors (1155589).
11739131 is a wasteful number, since it uses less digits than its factorization.
11739131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26905.
The product of its digits is 567, while the sum is 26.
The square root of 11739131 is about 3426.2415268046. The cubic root of 11739131 is about 227.2716768970.
The spelling of 11739131 in words is "eleven million, seven hundred thirty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •