Search a number
-
+
50110990513 = 1031583307337
BaseRepresentation
bin101110101010110110…
…010000100010110001
311210100022200001222121
4232222312100202301
51310111403144023
635004244234241
73422540251153
oct565266204261
9153308601877
1050110990513
111a285390951
12986609b981
134957a60b9c
1425d5382ad3
1514844bad5d
hexbaad908b1

50110990513 has 8 divisors (see below), whose sum is σ = 50629632768. Its totient is φ = 49592966304.

The previous prime is 50110990499. The next prime is 50110990519. The reversal of 50110990513 is 31509901105.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50110990513 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9381 + ... + 316717.

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

Almost surely, 250110990513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 309023.

The product of its (nonzero) digits is 6075, while the sum is 34.

The spelling of 50110990513 in words is "fifty billion, one hundred ten million, nine hundred ninety thousand, five hundred thirteen".

Divisors: 1 103 1583 163049 307337 31655711 486514471 50110990513