Base | Representation |
---|---|
bin | 1011111101011… |
… | …0100000010001 |
3 | 10111101110220001 |
4 | 2333112200101 |
5 | 100320133211 |
6 | 4551050001 |
7 | 1146236653 |
oct | 277264021 |
9 | 114343801 |
10 | 50161681 |
11 | 26351239 |
12 | 14970901 |
13 | a513b8b |
14 | 693a6d3 |
15 | 460cac1 |
hex | 2fd6811 |
50161681 has 2 divisors, whose sum is σ = 50161682. Its totient is φ = 50161680.
The previous prime is 50161673. The next prime is 50161711. The reversal of 50161681 is 18616105.
50161681 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., 47389456 + 2772225 = 6884^2 + 1665^2 .
It is a cyclic number.
It is not a de Polignac number, because 50161681 - 23 = 50161673 is a prime.
It is a super-2 number, since 2×501616812 = 5032388481491522, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50761681) 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, 25080840 + 25080841.
It is an arithmetic number, because the mean of its divisors is an integer number (25080841).
Almost surely, 250161681 is an apocalyptic number.
It is an amenable number.
50161681 is a deficient number, since it is larger than the sum of its proper divisors (1).
50161681 is an equidigital number, since it uses as much as digits as its factorization.
50161681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 28.
The square root of 50161681 is about 7082.4911577777. The cubic root of 50161681 is about 368.7998145476.
Adding to 50161681 its reverse (18616105), we get a palindrome (68777786).
The spelling of 50161681 in words is "fifty million, one hundred sixty-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •