Search a number
-
+
5033663305 = 51191521151
BaseRepresentation
bin1001011000000011…
…11001101101001001
3110222210201120221021
410230001321231021
540302104211210
62151252512441
7235511301136
oct45401715511
913883646837
105033663305
11215340a820
12b8591b721
13622b170c8
1435a74558d
151e6da5bda
hex12c079b49

5033663305 has 8 divisors (see below), whose sum is σ = 6589522944. Its totient is φ = 3660846000.

The previous prime is 5033663279. The next prime is 5033663311.

5033663305 is nontrivially palindromic in base 10.

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

It is not a de Polignac number, because 5033663305 - 27 = 5033663177 is a prime.

It is a Duffinian number.

It is an unprimeable number.

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

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

Almost surely, 25033663305 is an apocalyptic number.

5033663305 is a gapful number since it is divisible by the number (55) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 91521167.

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

The square root of 5033663305 is about 70948.3143210605. The cubic root of 5033663305 is about 1713.8049291987.

The spelling of 5033663305 in words is "five billion, thirty-three million, six hundred sixty-three thousand, three hundred five".

Divisors: 1 5 11 55 91521151 457605755 1006732661 5033663305