Base | Representation |
---|---|
bin | 1110100100011… |
… | …1011010010110 |
3 | 11020222201001000 |
4 | 3221013122112 |
5 | 111121004120 |
6 | 10021444130 |
7 | 1341266001 |
oct | 351073226 |
9 | 136881030 |
10 | 61109910 |
11 | 31549864 |
12 | 18570646 |
13 | c878214 |
14 | 818a538 |
15 | 5571990 |
hex | 3a47696 |
61109910 has 64 divisors (see below), whose sum is σ = 163814400. Its totient is φ = 16210656.
The previous prime is 61109887. The next prime is 61109911. The reversal of 61109910 is 1990116.
It is a super-2 number, since 2×611099102 = 7468842200416200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61109911) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64057 + ... + 65003.
It is an arithmetic number, because the mean of its divisors is an integer number (2559600).
Almost surely, 261109910 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61109910, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81907200).
61109910 is an abundant number, since it is smaller than the sum of its proper divisors (102704490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61109910 is a wasteful number, since it uses less digits than its factorization.
61109910 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1202 (or 1196 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
The square root of 61109910 is about 7817.2827760034. The cubic root of 61109910 is about 393.8860029052.
The spelling of 61109910 in words is "sixty-one million, one hundred nine thousand, nine hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •