Search a number
-
+
151331002113 = 31877241711119
BaseRepresentation
bin1000110011110000000…
…1111101011100000001
3112110121111222102112010
42030330001331130001
54434411214031423
6153304232323133
713635060202614
oct2147401753401
9473544872463
10151331002113
11591a74507a5
12253b45434a9
1311369250585
14747846217b
153e0a895693
hex233c07d701

151331002113 has 16 divisors (see below), whose sum is σ = 201983857920. Its totient is φ = 100782802176.

The previous prime is 151331002111. The next prime is 151331002129. The reversal of 151331002113 is 311200133151.

It is not a de Polignac number, because 151331002113 - 21 = 151331002111 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 151331002113.

It is not an unprimeable number, because it can be changed into a prime (151331002111) 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 15 ways as a sum of consecutive naturals, for example, 13604568 + ... + 13615686.

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

Almost surely, 2151331002113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15416.

The product of its (nonzero) digits is 270, while the sum is 21.

Adding to 151331002113 its reverse (311200133151), we get a palindrome (462531135264).

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

Divisors: 1 3 1877 2417 5631 7251 11119 33357 4536709 13610127 20870363 26874623 62611089 80623869 50443667371 151331002113