Base | Representation |
---|---|
bin | 1100000011101… |
… | …0000100001001 |
3 | 10112011012021202 |
4 | 3000322010021 |
5 | 100421210411 |
6 | 5003513545 |
7 | 1152555614 |
oct | 300720411 |
9 | 115135252 |
10 | 50569481 |
11 | 265aa666 |
12 | 14b288b5 |
13 | a627691 |
14 | 6a0517b |
15 | 468d83b |
hex | 303a109 |
50569481 has 2 divisors, whose sum is σ = 50569482. Its totient is φ = 50569480.
The previous prime is 50569459. The next prime is 50569483. The reversal of 50569481 is 18496505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 37319881 + 13249600 = 6109^2 + 3640^2 .
It is a cyclic number.
It is not a de Polignac number, because 50569481 - 218 = 50307337 is a prime.
It is a super-2 number, since 2×505694812 = 5114544817218722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 50569483, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (50569483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25284740 + 25284741.
It is an arithmetic number, because the mean of its divisors is an integer number (25284741).
Almost surely, 250569481 is an apocalyptic number.
It is an amenable number.
50569481 is a deficient number, since it is larger than the sum of its proper divisors (1).
50569481 is an equidigital number, since it uses as much as digits as its factorization.
50569481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 38.
The square root of 50569481 is about 7111.2221875005. Note that the first 3 decimals coincide. The cubic root of 50569481 is about 369.7965304470.
The spelling of 50569481 in words is "fifty million, five hundred sixty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •