Base | Representation |
---|---|
bin | 1011111100100… |
… | …1001101011110 |
3 | 10111021201012100 |
4 | 2333021031132 |
5 | 100311412410 |
6 | 4545545530 |
7 | 1145622135 |
oct | 277111536 |
9 | 114251170 |
10 | 50107230 |
11 | 26314338 |
12 | 149452a6 |
13 | a4c5164 |
14 | 692491c |
15 | 45eb8c0 |
hex | 2fc935e |
50107230 has 48 divisors (see below), whose sum is σ = 132429024. Its totient is φ = 13141440.
The previous prime is 50107229. The next prime is 50107241. The reversal of 50107230 is 3270105.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an alternating number because its digits alternate between odd and even.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 927 + ... + 10053.
It is an arithmetic number, because the mean of its divisors is an integer number (2758938).
Almost surely, 250107230 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50107230, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66214512).
50107230 is an abundant number, since it is smaller than the sum of its proper divisors (82321794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50107230 is a wasteful number, since it uses less digits than its factorization.
50107230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9201 (or 9198 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 50107230 is about 7078.6460569801. The cubic root of 50107230 is about 368.6663209531. Note that the first 3 decimals are identical.
Adding to 50107230 its reverse (3270105), we get a palindrome (53377335).
The spelling of 50107230 in words is "fifty million, one hundred seven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •