Search a number
-
+
50155681 is a prime number
BaseRepresentation
bin1011111101010…
…1000010100001
310111101011122211
42333111002201
5100314440211
64551002121
71146213322
oct277250241
9114334584
1050155681
1126347784
1214969341
13a511224
146938449
15460ae21
hex2fd50a1

50155681 has 2 divisors, whose sum is σ = 50155682. Its totient is φ = 50155680.

The previous prime is 50155667. The next prime is 50155697. The reversal of 50155681 is 18655105.

50155681 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., 37015056 + 13140625 = 6084^2 + 3625^2 .

It is a cyclic number.

It is not a de Polignac number, because 50155681 - 29 = 50155169 is a prime.

It is a super-2 number, since 2×501556812 = 5031184673147522, which contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (50155631) 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, 25077840 + 25077841.

It is an arithmetic number, because the mean of its divisors is an integer number (25077841).

Almost surely, 250155681 is an apocalyptic number.

It is an amenable number.

50155681 is a deficient number, since it is larger than the sum of its proper divisors (1).

50155681 is an equidigital number, since it uses as much as digits as its factorization.

50155681 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 6000, while the sum is 31.

The square root of 50155681 is about 7082.0675653371. The cubic root of 50155681 is about 368.7851095173.

The spelling of 50155681 in words is "fifty million, one hundred fifty-five thousand, six hundred eighty-one".