Base | Representation |
---|---|
bin | 1110100101111… |
… | …0111110001101 |
3 | 11021011121102012 |
4 | 3221132332031 |
5 | 111132101123 |
6 | 10023511005 |
7 | 1342150232 |
oct | 351367615 |
9 | 137147365 |
10 | 61206413 |
11 | 31605314 |
12 | 185b8465 |
13 | c8b0118 |
14 | 81b3789 |
15 | 5590378 |
hex | 3a5ef8d |
61206413 has 4 divisors (see below), whose sum is σ = 61294428. Its totient is φ = 61118400.
The previous prime is 61206403. The next prime is 61206437. The reversal of 61206413 is 31460216.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26183689 + 35022724 = 5117^2 + 5918^2 .
It is a cyclic number.
It is not a de Polignac number, because 61206413 - 220 = 60157837 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61206403) 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 3 ways as a sum of consecutive naturals, for example, 42956 + ... + 44357.
It is an arithmetic number, because the mean of its divisors is an integer number (15323607).
Almost surely, 261206413 is an apocalyptic number.
It is an amenable number.
61206413 is a deficient number, since it is larger than the sum of its proper divisors (88015).
61206413 is an equidigital number, since it uses as much as digits as its factorization.
61206413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88014.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 61206413 is about 7823.4527543790. The cubic root of 61206413 is about 394.0932316496.
Adding to 61206413 its reverse (31460216), we get a palindrome (92666629).
The spelling of 61206413 in words is "sixty-one million, two hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •