Search a number
-
+
151531113103 = 1371106066519
BaseRepresentation
bin1000110100011111110…
…1010100101010001111
3112111010110112010012021
42031013331110222033
54440313431104403
6153340141351011
713643040131566
oct2150775245217
9474113463167
10151531113103
115929a3aa087
122544b568467
131139b846246
147496c72bdd
153e1d2228bd
hex2347f54a8f

151531113103 has 4 divisors (see below), whose sum is σ = 152637179760. Its totient is φ = 150425046448.

The previous prime is 151531113091. The next prime is 151531113131. The reversal of 151531113103 is 301311135151.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151531113103 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 (151531113143) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 553033123 + ... + 553033396.

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

Almost surely, 2151531113103 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1106066656.

The product of its (nonzero) digits is 675, while the sum is 25.

Adding to 151531113103 its reverse (301311135151), we get a palindrome (452842248254).

The spelling of 151531113103 in words is "one hundred fifty-one billion, five hundred thirty-one million, one hundred thirteen thousand, one hundred three".

Divisors: 1 137 1106066519 151531113103