Search a number
-
+
1101311151 = 32291603073
BaseRepresentation
bin100000110100100…
…1010110010101111
32211202022101212220
41001221022302233
54223413424101
6301140530423
736201663453
oct10151126257
92752271786
101101311151
11515730406
122689b0a13
1314721c705
14a63a0663
1566a44636
hex41a4acaf

1101311151 has 8 divisors (see below), whose sum is σ = 1474828080. Its totient is φ = 731000832.

The previous prime is 1101311149. The next prime is 1101311201. The reversal of 1101311151 is 1511131011.

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

It is not a de Polignac number, because 1101311151 - 21 = 1101311149 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21101311151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1603305.

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

The square root of 1101311151 is about 33186.0083619588. The cubic root of 1101311151 is about 1032.6900965778.

Adding to 1101311151 its reverse (1511131011), we get a palindrome (2612442162).

The spelling of 1101311151 in words is "one billion, one hundred one million, three hundred eleven thousand, one hundred fifty-one".

Divisors: 1 3 229 687 1603073 4809219 367103717 1101311151