Base | Representation |
---|---|
bin | 1110100100100… |
… | …1001000111110 |
3 | 11021000001202020 |
4 | 3221021020332 |
5 | 111121220430 |
6 | 10021541010 |
7 | 1341325434 |
oct | 351111076 |
9 | 137001666 |
10 | 61116990 |
11 | 31554110 |
12 | 18574766 |
13 | c87b4cc |
14 | 818cd54 |
15 | 5573b10 |
hex | 3a4923e |
61116990 has 64 divisors (see below), whose sum is σ = 161118720. Its totient is φ = 14714240.
The previous prime is 61116973. The next prime is 61117031. The reversal of 61116990 is 9961116.
61116990 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
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 in 31 ways as a sum of consecutive naturals, for example, 54556 + ... + 55664.
It is an arithmetic number, because the mean of its divisors is an integer number (2517480).
Almost surely, 261116990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61116990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80559360).
61116990 is an abundant number, since it is smaller than the sum of its proper divisors (100001730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61116990 is a wasteful number, since it uses less digits than its factorization.
61116990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297.
The product of its (nonzero) digits is 2916, while the sum is 33.
The square root of 61116990 is about 7817.7356056597. The cubic root of 61116990 is about 393.9012137781.
The spelling of 61116990 in words is "sixty-one million, one hundred sixteen thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •