Search a number
-
+
13151062153 = 231135060047
BaseRepresentation
bin11000011111101110…
…10100100010001001
31020221112001011210001
430033313110202021
5203413132442103
610012544523001
7643616120035
oct141767244211
936845034701
1013151062153
115639482709
122670320461
1313177831a8
148ca84d1c5
1551e84101d
hex30fdd4889

13151062153 has 8 divisors (see below), whose sum is σ = 13844291328. Its totient is φ = 12467953344.

The previous prime is 13151062123. The next prime is 13151062157. The reversal of 13151062153 is 35126015131.

13151062153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not a de Polignac number, because 13151062153 - 221 = 13148965001 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (13151062157) 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, 2527425 + ... + 2532622.

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

Almost surely, 213151062153 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5060183.

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

Adding to 13151062153 its reverse (35126015131), we get a palindrome (48277077284).

The spelling of 13151062153 in words is "thirteen billion, one hundred fifty-one million, sixty-two thousand, one hundred fifty-three".

Divisors: 1 23 113 2599 5060047 116381081 571785311 13151062153