Base | Representation |
---|---|
bin | 1011111011100… |
… | …1100011011000 |
3 | 10111011110020000 |
4 | 2332321203120 |
5 | 100302334341 |
6 | 4544333000 |
7 | 1145234145 |
oct | 276714330 |
9 | 114143200 |
10 | 50043096 |
11 | 26280134 |
12 | 14914160 |
13 | a4a1bcc |
14 | 69093cc |
15 | 45d78b6 |
hex | 2fb98d8 |
50043096 has 80 divisors (see below), whose sum is σ = 145054800. Its totient is φ = 16099776.
The previous prime is 50043073. The next prime is 50043113. The reversal of 50043096 is 69034005.
It is a happy number.
It is a super-2 number, since 2×500430962 = 5008622914530432, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17461 + ... + 20123.
It is an arithmetic number, because the mean of its divisors is an integer number (1813185).
Almost surely, 250043096 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 50043096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72527400).
50043096 is an abundant number, since it is smaller than the sum of its proper divisors (95011704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50043096 is a wasteful number, since it uses less digits than its factorization.
50043096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2710 (or 2697 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 50043096 is about 7074.1145028901. The cubic root of 50043096 is about 368.5089641497.
It can be divided in two parts, 5004 and 3096, that added together give a square (8100 = 902).
The spelling of 50043096 in words is "fifty million, forty-three thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •