Base | Representation |
---|---|
bin | 1110100100100… |
… | …0011101100011 |
3 | 11020222220221022 |
4 | 3221020131203 |
5 | 111121123321 |
6 | 10021520055 |
7 | 1341314354 |
oct | 351103543 |
9 | 136886838 |
10 | 61114211 |
11 | 31552014 |
12 | 1857302b |
13 | c87a172 |
14 | 818bd2b |
15 | 5572dab |
hex | 3a48763 |
61114211 has 2 divisors, whose sum is σ = 61114212. Its totient is φ = 61114210.
The previous prime is 61114199. The next prime is 61114259. The reversal of 61114211 is 11241116.
61114211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a m-pointer prime, because the next prime (61114259) can be obtained adding 61114211 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61114211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 61114211.
It is not a weakly prime, because it can be changed into another prime (61114271) 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, 30557105 + 30557106.
It is an arithmetic number, because the mean of its divisors is an integer number (30557106).
Almost surely, 261114211 is an apocalyptic number.
61114211 is a deficient number, since it is larger than the sum of its proper divisors (1).
61114211 is an equidigital number, since it uses as much as digits as its factorization.
61114211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 17.
The square root of 61114211 is about 7817.5578667510. The cubic root of 61114211 is about 393.8952434357.
Adding to 61114211 its reverse (11241116), we get a palindrome (72355327).
The spelling of 61114211 in words is "sixty-one million, one hundred fourteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •