Base | Representation |
---|---|
bin | 1111000000111110000011 |
3 | 21101222100122 |
4 | 33000332003 |
5 | 2001424011 |
6 | 220210455 |
7 | 45312413 |
oct | 17007603 |
9 | 7358318 |
10 | 3936131 |
11 | 2249301 |
12 | 1399a2b |
13 | a7a794 |
14 | 746643 |
15 | 52b3db |
hex | 3c0f83 |
3936131 has 2 divisors, whose sum is σ = 3936132. Its totient is φ = 3936130.
The previous prime is 3936113. The next prime is 3936137. The reversal of 3936131 is 1316393.
3936131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (3936113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3936131 - 218 = 3673987 is a prime.
It is a super-2 number, since 2×39361312 = 30986254498322, which contains 22 as substring.
It is a Chen prime.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 3936131.
It is not a weakly prime, because it can be changed into another prime (3936137) 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 as a sum of consecutive naturals, namely, 1968065 + 1968066.
It is an arithmetic number, because the mean of its divisors is an integer number (1968066).
Almost surely, 23936131 is an apocalyptic number.
3936131 is a deficient number, since it is larger than the sum of its proper divisors (1).
3936131 is an equidigital number, since it uses as much as digits as its factorization.
3936131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1458, while the sum is 26.
The square root of 3936131 is about 1983.9684977338. The cubic root of 3936131 is about 157.8906870872.
The spelling of 3936131 in words is "three million, nine hundred thirty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •