Search a number
-
+
50113005490 = 255011300549
BaseRepresentation
bin101110101010111101…
…111100011110110010
311210100110110110000101
4232222331330132302
51310112412133430
635004355343014
73422563342552
oct565275743662
9153313413011
1050113005490
111a286537819
1298668b1a6a
1349582b8092
1425d5749162
151484767dca
hexbaaf7c7b2

50113005490 has 8 divisors (see below), whose sum is σ = 90203409900. Its totient is φ = 20045202192.

The previous prime is 50113005469. The next prime is 50113005493. The reversal of 50113005490 is 9450031105.

It can be written as a sum of positive squares in 2 ways, for example, as 47971074529 + 2141930961 = 219023^2 + 46281^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×501130054902 (a number of 22 digits) contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (50113005493) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2505650265 + ... + 2505650284.

Almost surely, 250113005490 is an apocalyptic number.

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

50113005490 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 5011300556.

The product of its (nonzero) digits is 2700, while the sum is 28.

Adding to 50113005490 its reverse (9450031105), we get a palindrome (59563036595).

The spelling of 50113005490 in words is "fifty billion, one hundred thirteen million, five thousand, four hundred ninety".

Divisors: 1 2 5 10 5011300549 10022601098 25056502745 50113005490