Base | Representation |
---|---|
bin | 1110100101111… |
… | …1110111111001 |
3 | 11021011210110221 |
4 | 3221133313321 |
5 | 111132210410 |
6 | 10023540041 |
7 | 1342164055 |
oct | 351376771 |
9 | 137153427 |
10 | 61210105 |
11 | 31608070 |
12 | 185ba621 |
13 | c8b19c8 |
14 | 81b4c65 |
15 | 55914da |
hex | 3a5fdf9 |
61210105 has 8 divisors (see below), whose sum is σ = 80129664. Its totient is φ = 44516400.
The previous prime is 61210103. The next prime is 61210109. The reversal of 61210105 is 50101216.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61210105 - 21 = 61210103 is a prime.
It is a super-2 number, since 2×612101052 = 7493353908222050, which contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61210103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 556401 + ... + 556510.
It is an arithmetic number, because the mean of its divisors is an integer number (10016208).
Almost surely, 261210105 is an apocalyptic number.
It is an amenable number.
61210105 is a deficient number, since it is larger than the sum of its proper divisors (18919559).
61210105 is a wasteful number, since it uses less digits than its factorization.
61210105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112927.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 61210105 is about 7823.6887080200. The cubic root of 61210105 is about 394.1011554541.
Subtracting from 61210105 its reverse (50101216), we obtain a square (11108889 = 33332).
The spelling of 61210105 in words is "sixty-one million, two hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •