Base | Representation |
---|---|
bin | 1100000010000… |
… | …0100101011000 |
3 | 10111221220010020 |
4 | 3000200211120 |
5 | 100404340422 |
6 | 5001350440 |
7 | 1151642415 |
oct | 300404530 |
9 | 114856106 |
10 | 50465112 |
11 | 26539205 |
12 | 14a98420 |
13 | a5bc019 |
14 | 69b910c |
15 | 466c95c |
hex | 3020958 |
50465112 has 64 divisors (see below), whose sum is σ = 134524800. Its totient is φ = 15720960.
The previous prime is 50465111. The next prime is 50465113. The reversal of 50465112 is 21156405.
It is an interprime number because it is at equal distance from previous prime (50465111) and next prime (50465113).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50465111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72687 + ... + 73377.
It is an arithmetic number, because the mean of its divisors is an integer number (2101950).
Almost surely, 250465112 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 50465112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67262400).
50465112 is an abundant number, since it is smaller than the sum of its proper divisors (84059688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50465112 is a wasteful number, since it uses less digits than its factorization.
50465112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 896 (or 892 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 50465112 is about 7103.8800665552. The cubic root of 50465112 is about 369.5419508353.
The spelling of 50465112 in words is "fifty million, four hundred sixty-five thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •