Base | Representation |
---|---|
bin | 1110100101111… |
… | …1100011101011 |
3 | 11021011201201000 |
4 | 3221133203223 |
5 | 111132140221 |
6 | 10023530043 |
7 | 1342160226 |
oct | 351374353 |
9 | 137151630 |
10 | 61208811 |
11 | 316070a4 |
12 | 185b9923 |
13 | c8b1241 |
14 | 81b45bd |
15 | 5590e26 |
hex | 3a5f8eb |
61208811 has 8 divisors (see below), whose sum is σ = 90679760. Its totient is φ = 40805856.
The previous prime is 61208809. The next prime is 61208813. The reversal of 61208811 is 11880216.
It is an interprime number because it is at equal distance from previous prime (61208809) and next prime (61208813).
It is not a de Polignac number, because 61208811 - 21 = 61208809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 2266993 = 61208811 / (6 + 1 + 2 + 0 + 8 + 8 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61208813) 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 in 7 ways as a sum of consecutive naturals, for example, 1133470 + ... + 1133523.
It is an arithmetic number, because the mean of its divisors is an integer number (11334970).
Almost surely, 261208811 is an apocalyptic number.
61208811 is a deficient number, since it is larger than the sum of its proper divisors (29470949).
61208811 is a wasteful number, since it uses less digits than its factorization.
61208811 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2267002 (or 2266996 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 27.
The square root of 61208811 is about 7823.6060100187. The cubic root of 61208811 is about 394.0983782956.
The spelling of 61208811 in words is "sixty-one million, two hundred eight thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •