Base | Representation |
---|---|
bin | 1110100011100… |
… | …1101100110110 |
3 | 11020212212000000 |
4 | 3220321230312 |
5 | 111112210000 |
6 | 10020332130 |
7 | 1340643162 |
oct | 350715466 |
9 | 136785000 |
10 | 61053750 |
11 | 3151064a |
12 | 18544046 |
13 | c8587a4 |
14 | 8173ca2 |
15 | 5560000 |
hex | 3a39b36 |
61053750 has 140 divisors (see below), whose sum is σ = 174141132. Its totient is φ = 16038000.
The previous prime is 61053743. The next prime is 61053757. The reversal of 61053750 is 5735016.
It is an interprime number because it is at equal distance from previous prime (61053743) and next prime (61053757).
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 (61053757) by changing a digit.
It is a polite number, since it can be written in 69 ways as a sum of consecutive naturals, for example, 911217 + ... + 911283.
Almost surely, 261053750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 61053750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87070566).
61053750 is an abundant number, since it is smaller than the sum of its proper divisors (113087382).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61053750 is an frugal number, since it uses more digits than its factorization.
61053750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107 (or 77 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The square root of 61053750 is about 7813.6899093834. The cubic root of 61053750 is about 393.7653055275.
Adding to 61053750 its reverse (5735016), we get a palindrome (66788766).
The spelling of 61053750 in words is "sixty-one million, fifty-three thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •