Base | Representation |
---|---|
bin | 1100011011100… |
… | …1111000111111 |
3 | 10122010001212112 |
4 | 3012321320333 |
5 | 101322013011 |
6 | 5101324235 |
7 | 1202124263 |
oct | 306717077 |
9 | 118101775 |
10 | 52141631 |
11 | 27483863 |
12 | 1556667b |
13 | aa58149 |
14 | 6cd40a3 |
15 | 489e58b |
hex | 31b9e3f |
52141631 has 2 divisors, whose sum is σ = 52141632. Its totient is φ = 52141630.
The previous prime is 52141603. The next prime is 52141633. The reversal of 52141631 is 13614125.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-52141631 is a prime.
It is a super-2 number, since 2×521416312 = 5437499366680322, which contains 22 as substring.
Together with 52141633, it forms a pair of twin primes.
It is a Chen prime.
It is a plaindrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 52141597 and 52141606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52141633) 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 as a sum of consecutive naturals, namely, 26070815 + 26070816.
It is an arithmetic number, because the mean of its divisors is an integer number (26070816).
Almost surely, 252141631 is an apocalyptic number.
52141631 is a deficient number, since it is larger than the sum of its proper divisors (1).
52141631 is an equidigital number, since it uses as much as digits as its factorization.
52141631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 23.
The square root of 52141631 is about 7220.9162161044. The cubic root of 52141631 is about 373.5896798264.
Adding to 52141631 its reverse (13614125), we get a palindrome (65755756).
The spelling of 52141631 in words is "fifty-two million, one hundred forty-one thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •