Base | Representation |
---|---|
bin | 1100000111010… |
… | …0110001101011 |
3 | 10112121102011111 |
4 | 3001310301223 |
5 | 101001404323 |
6 | 5013011151 |
7 | 1154610001 |
oct | 301646153 |
9 | 115542144 |
10 | 50809963 |
11 | 26754306 |
12 | 15023ab7 |
13 | a6acc89 |
14 | 6a68a71 |
15 | 46d9c0d |
hex | 3074c6b |
50809963 has 4 divisors (see below), whose sum is σ = 50824368. Its totient is φ = 50795560.
The previous prime is 50809951. The next prime is 50809999. The reversal of 50809963 is 36990805.
50809963 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 50809963 - 213 = 50801771 is a prime.
It is a super-2 number, since 2×508099632 = 5163304680122738, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50809903) 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 3 ways as a sum of consecutive naturals, for example, 2058 + ... + 10288.
It is an arithmetic number, because the mean of its divisors is an integer number (12706092).
Almost surely, 250809963 is an apocalyptic number.
50809963 is a deficient number, since it is larger than the sum of its proper divisors (14405).
50809963 is an equidigital number, since it uses as much as digits as its factorization.
50809963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14404.
The product of its (nonzero) digits is 58320, while the sum is 40.
The square root of 50809963 is about 7128.1107595211. The cubic root of 50809963 is about 370.3817899848.
The spelling of 50809963 in words is "fifty million, eight hundred nine thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •