Search a number
-
+
115108141151 = 653547932173
BaseRepresentation
bin110101100110011111…
…0101101100001011111
3102000010002021102201002
41223030332231201133
53341220141004101
6124514022540515
711213326025153
oct1531476554137
9360102242632
10115108141151
11448a95aa173
121a38559773b
13ab1588ca33
1457dd795063
152eda7b0d6b
hex1accfad85f

115108141151 has 8 divisors (see below), whose sum is σ = 115309042080. Its totient is φ = 114907316832.

The previous prime is 115108141103. The next prime is 115108141171. The reversal of 115108141151 is 151141801511.

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

It is a cyclic number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3561701 + ... + 3593873.

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

Almost surely, 2115108141151 is an apocalyptic number.

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

115108141151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 38305.

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

Adding to 115108141151 its reverse (151141801511), we get a palindrome (266249942662).

The spelling of 115108141151 in words is "one hundred fifteen billion, one hundred eight million, one hundred forty-one thousand, one hundred fifty-one".

Divisors: 1 653 5479 32173 3577787 21008969 176275867 115108141151