Base | Representation |
---|---|
bin | 1100000101101… |
… | …1101010010101 |
3 | 10112102012001111 |
4 | 3001123222111 |
5 | 100440111333 |
6 | 5010455021 |
7 | 1154001043 |
oct | 301335225 |
9 | 115365044 |
10 | 50707093 |
11 | 26693a98 |
12 | 14b94471 |
13 | a6751c8 |
14 | 6a3d393 |
15 | 46b94cd |
hex | 305ba95 |
50707093 has 2 divisors, whose sum is σ = 50707094. Its totient is φ = 50707092.
The previous prime is 50707049. The next prime is 50707099. The reversal of 50707093 is 39070705.
50707093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35784324 + 14922769 = 5982^2 + 3863^2 .
It is a cyclic number.
It is not a de Polignac number, because 50707093 - 29 = 50706581 is a prime.
It is a super-4 number, since 4×507070934 (a number of 32 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50707099) 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, 25353546 + 25353547.
It is an arithmetic number, because the mean of its divisors is an integer number (25353547).
Almost surely, 250707093 is an apocalyptic number.
It is an amenable number.
50707093 is a deficient number, since it is larger than the sum of its proper divisors (1).
50707093 is an equidigital number, since it uses as much as digits as its factorization.
50707093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6615, while the sum is 31.
The square root of 50707093 is about 7120.8913065711. The cubic root of 50707093 is about 370.1316624200.
Adding to 50707093 its reverse (39070705), we get a palindrome (89777798).
The spelling of 50707093 in words is "fifty million, seven hundred seven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •