Search a number
-
+
5303311535 = 510110501607
BaseRepresentation
bin1001111000001101…
…00001110010101111
3111200121010010202202
410330012201302233
541330121432120
62234124212115
7245264255444
oct47406416257
914617103682
105303311535
1122816434a5
12104009a03b
13666948a82
143844979cb
152108bb875
hex13c1a1caf

5303311535 has 8 divisors (see below), whose sum is σ = 6426984096. Its totient is φ = 4200642400.

The previous prime is 5303311529. The next prime is 5303311543. The reversal of 5303311535 is 5351133035.

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

It is not a de Polignac number, because 5303311535 - 210 = 5303310511 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 5303311498 and 5303311507.

It is a congruent number.

It is an unprimeable number.

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, 5250299 + ... + 5251308.

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

Almost surely, 25303311535 is an apocalyptic number.

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

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

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

The sum of its prime factors is 10501713.

The product of its (nonzero) digits is 10125, while the sum is 29.

The square root of 5303311535 is about 72823.8390570011. The cubic root of 5303311535 is about 1743.8764518037.

The spelling of 5303311535 in words is "five billion, three hundred three million, three hundred eleven thousand, five hundred thirty-five".

Divisors: 1 5 101 505 10501607 52508035 1060662307 5303311535