Base | Representation |
---|---|
bin | 101110111110… |
… | …111111010111 |
3 | 212011202020112 |
4 | 232332333113 |
5 | 11123113011 |
6 | 1115553235 |
7 | 206455355 |
oct | 56767727 |
9 | 25152215 |
10 | 12316631 |
11 | 6a52738 |
12 | 415b81b |
13 | 2723162 |
14 | 18c87d5 |
15 | 113458b |
hex | bbefd7 |
12316631 has 2 divisors, whose sum is σ = 12316632. Its totient is φ = 12316630.
The previous prime is 12316627. The next prime is 12316639. The reversal of 12316631 is 13661321.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (13661321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12316631 - 22 = 12316627 is a prime.
It is a super-2 number, since 2×123166312 = 303398798380322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a plaindrome in base 15.
It is a junction number, because it is equal to n+sod(n) for n = 12316597 and 12316606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12316639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6158315 + 6158316.
It is an arithmetic number, because the mean of its divisors is an integer number (6158316).
Almost surely, 212316631 is an apocalyptic number.
12316631 is a deficient number, since it is larger than the sum of its proper divisors (1).
12316631 is an equidigital number, since it uses as much as digits as its factorization.
12316631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 23.
The square root of 12316631 is about 3509.5058056655. The cubic root of 12316631 is about 230.9390155287.
Adding to 12316631 its reverse (13661321), we get a palindrome (25977952).
The spelling of 12316631 in words is "twelve million, three hundred sixteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •