Base | Representation |
---|---|
bin | 1100000111100… |
… | …1101100001101 |
3 | 10112122102210001 |
4 | 3001321230031 |
5 | 101003030333 |
6 | 5013244301 |
7 | 1155022456 |
oct | 301715415 |
9 | 115572701 |
10 | 50830093 |
11 | 26768446 |
12 | 15033691 |
13 | a6b91a2 |
14 | 6a7212d |
15 | 46e0b7d |
hex | 3079b0d |
50830093 has 8 divisors (see below), whose sum is σ = 51991200. Its totient is φ = 49679088.
The previous prime is 50830081. The next prime is 50830097. The reversal of 50830093 is 39003805.
It is a happy number.
50830093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50830093 - 25 = 50830061 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50830097) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 8155 + ... + 12967.
It is an arithmetic number, because the mean of its divisors is an integer number (6498900).
Almost surely, 250830093 is an apocalyptic number.
It is an amenable number.
50830093 is a deficient number, since it is larger than the sum of its proper divisors (1161107).
50830093 is a wasteful number, since it uses less digits than its factorization.
50830093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5051.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 50830093 is about 7129.5226347912. The cubic root of 50830093 is about 370.4306964105.
Adding to 50830093 its reverse (39003805), we get a palindrome (89833898).
The spelling of 50830093 in words is "fifty million, eight hundred thirty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •