Search a number
-
+
151151611105 = 511101104925939
BaseRepresentation
bin1000110011000101010…
…1101000110011100001
3112110011000102102022201
42030301111220303201
54434024303023410
6153234343333201
713630451332015
oct2146125506341
9473130372281
10151151611105
1159115164670
1225364451201
131133b030951
14745c6c6545
153de9c5c83a
hex2331568ce1

151151611105 has 32 divisors (see below), whose sum is σ = 200028528000. Its totient is φ = 108732096000.

The previous prime is 151151611103. The next prime is 151151611111. The reversal of 151151611105 is 501116151151.

It is not a de Polignac number, because 151151611105 - 21 = 151151611103 is a prime.

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

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

Almost surely, 2151151611105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 27105.

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

Adding to 151151611105 its reverse (501116151151), we get a palindrome (652267762256).

The spelling of 151151611105 in words is "one hundred fifty-one billion, one hundred fifty-one million, six hundred eleven thousand, one hundred five".

Divisors: 1 5 11 55 101 505 1049 1111 5245 5555 11539 25939 57695 105949 129695 285329 529745 1165439 1426645 2619839 5827195 13099195 27210011 28818229 136050055 144091145 299310121 1496550605 2748211111 13741055555 30230322221 151151611105