Base | Representation |
---|---|
bin | 1110100110000… |
… | …0110101100101 |
3 | 11021011222220011 |
4 | 3221200311211 |
5 | 111132322203 |
6 | 10024010221 |
7 | 1342211425 |
oct | 351406545 |
9 | 137158804 |
10 | 61214053 |
11 | 3161002a |
12 | 18600971 |
13 | c8b3744 |
14 | 81b6485 |
15 | 559276d |
hex | 3a60d65 |
61214053 has 2 divisors, whose sum is σ = 61214054. Its totient is φ = 61214052.
The previous prime is 61214051. The next prime is 61214089. The reversal of 61214053 is 35041216.
61214053 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 can be written as a sum of positive squares in only one way, i.e., 51868804 + 9345249 = 7202^2 + 3057^2 .
It is a cyclic number.
It is not a de Polignac number, because 61214053 - 21 = 61214051 is a prime.
Together with 61214051, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61214051) 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, 30607026 + 30607027.
It is an arithmetic number, because the mean of its divisors is an integer number (30607027).
Almost surely, 261214053 is an apocalyptic number.
It is an amenable number.
61214053 is a deficient number, since it is larger than the sum of its proper divisors (1).
61214053 is an equidigital number, since it uses as much as digits as its factorization.
61214053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 61214053 is about 7823.9410146038. The cubic root of 61214053 is about 394.1096283357.
Adding to 61214053 its reverse (35041216), we get a palindrome (96255269).
The spelling of 61214053 in words is "sixty-one million, two hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •