Base | Representation |
---|---|
bin | 1100000011101… |
… | …0110101011001 |
3 | 10112011100121111 |
4 | 3000322311121 |
5 | 100421311013 |
6 | 5003540321 |
7 | 1152601036 |
oct | 300726531 |
9 | 115140544 |
10 | 50572633 |
11 | 26601a71 |
12 | 14b2a6a1 |
13 | a628c47 |
14 | 6a0638d |
15 | 468e73d |
hex | 303ad59 |
50572633 has 2 divisors, whose sum is σ = 50572634. Its totient is φ = 50572632.
The previous prime is 50572631. The next prime is 50572651. The reversal of 50572633 is 33627505.
50572633 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47375689 + 3196944 = 6883^2 + 1788^2 .
It is a cyclic number.
It is not a de Polignac number, because 50572633 - 21 = 50572631 is a prime.
Together with 50572631, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 50572595 and 50572604.
It is not a weakly prime, because it can be changed into another prime (50572631) 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 as a sum of consecutive naturals, namely, 25286316 + 25286317.
It is an arithmetic number, because the mean of its divisors is an integer number (25286317).
Almost surely, 250572633 is an apocalyptic number.
It is an amenable number.
50572633 is a deficient number, since it is larger than the sum of its proper divisors (1).
50572633 is an equidigital number, since it uses as much as digits as its factorization.
50572633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18900, while the sum is 31.
The square root of 50572633 is about 7111.4438055855. The cubic root of 50572633 is about 369.8042134370.
The spelling of 50572633 in words is "fifty million, five hundred seventy-two thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •