Base | Representation |
---|---|
bin | 1110100101010… |
… | …0100000111100 |
3 | 11021002102122210 |
4 | 3221110200330 |
5 | 111124213310 |
6 | 10022540420 |
7 | 1341611322 |
oct | 351244074 |
9 | 137072583 |
10 | 61163580 |
11 | 31586115 |
12 | 18597710 |
13 | c89678a |
14 | 81a1d12 |
15 | 5582820 |
hex | 3a5483c |
61163580 has 48 divisors (see below), whose sum is σ = 172970784. Its totient is φ = 16147200.
The previous prime is 61163573. The next prime is 61163593. The reversal of 61163580 is 8536116.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1014 + ... + 11106.
It is an arithmetic number, because the mean of its divisors is an integer number (3603558).
Almost surely, 261163580 is an apocalyptic number.
61163580 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 61163580, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86485392).
61163580 is an abundant number, since it is smaller than the sum of its proper divisors (111807204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61163580 is a wasteful number, since it uses less digits than its factorization.
61163580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10206 (or 10204 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 61163580 is about 7820.7148010908. The cubic root of 61163580 is about 394.0012797677.
Adding to 61163580 its reverse (8536116), we get a palindrome (69699696).
The spelling of 61163580 in words is "sixty-one million, one hundred sixty-three thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •