Base | Representation |
---|---|
bin | 1100001000011… |
… | …0110110101101 |
3 | 10112202011202002 |
4 | 3002012312231 |
5 | 101011242023 |
6 | 5014342045 |
7 | 1155335615 |
oct | 302066655 |
9 | 115664662 |
10 | 50884013 |
11 | 267a4a04 |
12 | 1505a925 |
13 | a7078ab |
14 | 6a87a45 |
15 | 4701b28 |
hex | 3086dad |
50884013 has 4 divisors (see below), whose sum is σ = 51334428. Its totient is φ = 50433600.
The previous prime is 50883977. The next prime is 50884037. The reversal of 50884013 is 31048805.
50884013 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.
It can be written as a sum of positive squares in 2 ways, for example, as 232324 + 50651689 = 482^2 + 7117^2 .
It is a cyclic number.
It is not a de Polignac number, because 50884013 - 28 = 50883757 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 (50884313) 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, 225038 + ... + 225263.
It is an arithmetic number, because the mean of its divisors is an integer number (12833607).
Almost surely, 250884013 is an apocalyptic number.
It is an amenable number.
50884013 is a deficient number, since it is larger than the sum of its proper divisors (450415).
50884013 is a wasteful number, since it uses less digits than its factorization.
50884013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 450414.
The product of its (nonzero) digits is 3840, while the sum is 29.
The square root of 50884013 is about 7133.3030918362. The cubic root of 50884013 is about 370.5616330501.
The spelling of 50884013 in words is "fifty million, eight hundred eighty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •