Base | Representation |
---|---|
bin | 1011111100100… |
… | …1110100000100 |
3 | 10111021211120211 |
4 | 2333021310010 |
5 | 100312002300 |
6 | 4550005204 |
7 | 1145632264 |
oct | 277116404 |
9 | 114254524 |
10 | 50109700 |
11 | 26316183 |
12 | 14946804 |
13 | a4c6314 |
14 | 69257a4 |
15 | 45ec4ba |
hex | 2fc9d04 |
50109700 has 36 divisors (see below), whose sum is σ = 110131840. Its totient is φ = 19787040.
The previous prime is 50109691. The next prime is 50109721. The reversal of 50109700 is 790105.
50109700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4729 + ... + 11071.
Almost surely, 250109700 is an apocalyptic number.
50109700 is a gapful number since it is divisible by the number (50) 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 50109700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55065920).
50109700 is an abundant number, since it is smaller than the sum of its proper divisors (60022140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50109700 is a wasteful number, since it uses less digits than its factorization.
50109700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6436 (or 6429 counting only the distinct ones).
The product of its (nonzero) digits is 315, while the sum is 22.
The square root of 50109700 is about 7078.8205232228. The cubic root of 50109700 is about 368.6723785676.
Adding to 50109700 its reverse (790105), we get a palindrome (50899805).
The spelling of 50109700 in words is "fifty million, one hundred nine thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •