Base | Representation |
---|---|
bin | 1011111111111… |
… | …1100111000101 |
3 | 10111201000212001 |
4 | 2333333213011 |
5 | 100341030203 |
6 | 4554425301 |
7 | 1150540564 |
oct | 277774705 |
9 | 114630761 |
10 | 50330053 |
11 | 26456794 |
12 | 14a32231 |
13 | a5726c7 |
14 | 6981bdb |
15 | 464291d |
hex | 2fff9c5 |
50330053 has 2 divisors, whose sum is σ = 50330054. Its totient is φ = 50330052.
The previous prime is 50330029. The next prime is 50330057. The reversal of 50330053 is 35003305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43533604 + 6796449 = 6598^2 + 2607^2 .
It is a cyclic number.
It is not a de Polignac number, because 50330053 - 221 = 48232901 is a prime.
It is a super-2 number, since 2×503300532 = 5066228469965618, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50330053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50330057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25165026 + 25165027.
It is an arithmetic number, because the mean of its divisors is an integer number (25165027).
Almost surely, 250330053 is an apocalyptic number.
It is an amenable number.
50330053 is a deficient number, since it is larger than the sum of its proper divisors (1).
50330053 is an equidigital number, since it uses as much as digits as its factorization.
50330053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 19.
The square root of 50330053 is about 7094.3676955737. The cubic root of 50330053 is about 369.2119898312.
Adding to 50330053 its reverse (35003305), we get a palindrome (85333358).
The spelling of 50330053 in words is "fifty million, three hundred thirty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •