Search a number
-
+
5306451151 = 75721793217
BaseRepresentation
bin1001111000100101…
…00000010011001111
3111200211000122111211
410330102200103033
541331422414101
62234315355251
7245333043031
oct47422402317
914624018454
105306451151
112283398321
121041152b27
136674a7b31
14384a73c51
15210cdbc51
hex13c4a04cf

5306451151 has 8 divisors (see below), whose sum is σ = 5317551920. Its totient is φ = 5295362688.

The previous prime is 5306451131. The next prime is 5306451169. The reversal of 5306451151 is 1511546035.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 5306451151 - 27 = 5306451023 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

Almost surely, 25306451151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 6153.

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

The square root of 5306451151 is about 72845.3921054723. The cubic root of 5306451151 is about 1744.2205149606.

Adding to 5306451151 its reverse (1511546035), we get a palindrome (6817997186).

The spelling of 5306451151 in words is "five billion, three hundred six million, four hundred fifty-one thousand, one hundred fifty-one".

Divisors: 1 757 2179 3217 1649503 2435269 7009843 5306451151