Base | Representation |
---|---|
bin | 111000111010110001… |
… | …001001101111110000 |
3 | 12211202020121100211020 |
4 | 320322301021233300 |
5 | 2000131032140043 |
6 | 44024233215440 |
7 | 4262333140521 |
oct | 707261115760 |
9 | 184666540736 |
10 | 61115505648 |
11 | 23a12122a5a |
12 | ba17561580 |
13 | 59bc8a96c2 |
14 | 2d5aaaa848 |
15 | 18ca64ce83 |
hex | e3ac49bf0 |
61115505648 has 160 divisors (see below), whose sum is σ = 168766198272. Its totient is φ = 18991104000.
The previous prime is 61115505601. The next prime is 61115505691. The reversal of 61115505648 is 84650551116.
It is a happy number.
It is a super-2 number, since 2×611155056482 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 69370168 + ... + 69371048.
Almost surely, 261115505648 is an apocalyptic number.
61115505648 is a gapful number since it is divisible by the number (68) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61115505648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (84383099136).
61115505648 is an abundant number, since it is smaller than the sum of its proper divisors (107650692624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61115505648 is a wasteful number, since it uses less digits than its factorization.
61115505648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1623 (or 1617 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 42.
The spelling of 61115505648 in words is "sixty-one billion, one hundred fifteen million, five hundred five thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •