Base | Representation |
---|---|
bin | 111000111110000001… |
… | …011111010101000000 |
3 | 12211220001101001122000 |
4 | 320332001133111000 |
5 | 2000234022320000 |
6 | 44033503544000 |
7 | 4263565304163 |
oct | 707601372500 |
9 | 184801331560 |
10 | 61170120000 |
11 | 23a3aa35590 |
12 | ba318bb000 |
13 | 59cacbc1a2 |
14 | 2d64045ada |
15 | 18d033a000 |
hex | e3e05f540 |
61170120000 has 1120 divisors, whose sum is σ = 258997094400. Its totient is φ = 13996800000.
The previous prime is 61170119963. The next prime is 61170120017. The reversal of 61170120000 is 2107116.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
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 159 ways as a sum of consecutive naturals, for example, 225719865 + ... + 225720135.
Almost surely, 261170120000 is an apocalyptic number.
61170120000 is a gapful number since it is divisible by the number (60) 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 61170120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129498547200).
61170120000 is an abundant number, since it is smaller than the sum of its proper divisors (197826974400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61170120000 is a wasteful number, since it uses less digits than its factorization.
61170120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 342 (or 311 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
Adding to 61170120000 its reverse (2107116), we get a palindrome (61172227116).
The spelling of 61170120000 in words is "sixty-one billion, one hundred seventy million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •