Base | Representation |
---|---|
bin | 1011111111111… |
… | …1110011001111 |
3 | 10111201001220212 |
4 | 2333333303033 |
5 | 100341041311 |
6 | 4554433035 |
7 | 1150543055 |
oct | 277776317 |
9 | 114631825 |
10 | 50330831 |
11 | 26457331 |
12 | 14a3277b |
13 | a572b75 |
14 | 69821d5 |
15 | 4642c8b |
hex | 2fffccf |
50330831 has 4 divisors (see below), whose sum is σ = 52519152. Its totient is φ = 48142512.
The previous prime is 50330827. The next prime is 50330849. The reversal of 50330831 is 13803305.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50330831 - 22 = 50330827 is a prime.
It is a super-2 number, since 2×503308312 = 5066385098301122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23), and also a Moran number because the ratio is a prime number: 2188297 = 50330831 / (5 + 0 + 3 + 3 + 0 + 8 + 3 + 1).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50330797 and 50330806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50330801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1094126 + ... + 1094171.
It is an arithmetic number, because the mean of its divisors is an integer number (13129788).
Almost surely, 250330831 is an apocalyptic number.
50330831 is a deficient number, since it is larger than the sum of its proper divisors (2188321).
50330831 is a wasteful number, since it uses less digits than its factorization.
50330831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2188320.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 50330831 is about 7094.4225275917. The cubic root of 50330831 is about 369.2138922430.
The spelling of 50330831 in words is "fifty million, three hundred thirty thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •