Base | Representation |
---|---|
bin | 1100110010010… |
… | …1100010011011 |
3 | 10201220202002012 |
4 | 3030211202123 |
5 | 102212144011 |
6 | 5153300135 |
7 | 1220566661 |
oct | 314454233 |
9 | 121822065 |
10 | 53631131 |
11 | 28300954 |
12 | 15b6464b |
13 | b15a0c8 |
14 | 71a0c31 |
15 | 4a95a8b |
hex | 332589b |
53631131 has 2 divisors, whose sum is σ = 53631132. Its totient is φ = 53631130.
The previous prime is 53631119. The next prime is 53631187. The reversal of 53631131 is 13113635.
It is a happy number.
53631131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-53631131 is a prime.
It is a super-2 number, since 2×536311312 = 5752596424678322, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 53631097 and 53631106.
It is not a weakly prime, because it can be changed into another prime (53631631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26815565 + 26815566.
It is an arithmetic number, because the mean of its divisors is an integer number (26815566).
Almost surely, 253631131 is an apocalyptic number.
53631131 is a deficient number, since it is larger than the sum of its proper divisors (1).
53631131 is an equidigital number, since it uses as much as digits as its factorization.
53631131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 810, while the sum is 23.
The square root of 53631131 is about 7323.3278637516. The cubic root of 53631131 is about 377.1137074428.
Adding to 53631131 its reverse (13113635), we get a palindrome (66744766).
The spelling of 53631131 in words is "fifty-three million, six hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •