Base | Representation |
---|---|
bin | 1011111011111… |
… | …0000101011100 |
3 | 10111012101200120 |
4 | 2332332011130 |
5 | 100303433120 |
6 | 4544554540 |
7 | 1145342235 |
oct | 276760534 |
9 | 114171616 |
10 | 50061660 |
11 | 26293080 |
12 | 14922a50 |
13 | a4aa4ac |
14 | 691208c |
15 | 45dd140 |
hex | 2fbe15c |
50061660 has 96 divisors (see below), whose sum is σ = 154635264. Its totient is φ = 12000000.
The previous prime is 50061659. The next prime is 50061679. The reversal of 50061660 is 6616005.
It is a self number, because there is not a number n which added to its sum of digits gives 50061660.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 66285 + ... + 67035.
It is an arithmetic number, because the mean of its divisors is an integer number (1610784).
Almost surely, 250061660 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50061660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77317632).
50061660 is an abundant number, since it is smaller than the sum of its proper divisors (104573604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50061660 is a wasteful number, since it uses less digits than its factorization.
50061660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 875 (or 873 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 50061660 is about 7075.4264889122. The cubic root of 50061660 is about 368.5545259102.
Adding to 50061660 its reverse (6616005), we get a palindrome (56677665).
It can be divided in two parts, 50061 and 660, that added together give a triangular number (50721 = T318).
The spelling of 50061660 in words is "fifty million, sixty-one thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •