Search a number
-
+
115161506103 = 3723323535971
BaseRepresentation
bin110101101000000101…
…0010010000100110111
3102000020210200122122210
41223100022102010313
53341322321143403
6124523210424503
711214544436130
oct1532012220467
9360223618583
10115161506103
1144926739036
121a39b432133
13ab23955927
1458068c6c87
152ee0302b03
hex1ad0292137

115161506103 has 16 divisors (see below), whose sum is σ = 176237358336. Its totient is φ = 65524140480.

The previous prime is 115161506099. The next prime is 115161506137. The reversal of 115161506103 is 301605161511.

It is not a de Polignac number, because 115161506103 - 22 = 115161506099 is a prime.

It is a super-2 number, since 2×1151615061032 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (115161506153) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11763093 + ... + 11772878.

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

Almost surely, 2115161506103 is an apocalyptic number.

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

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

115161506103 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 23536214.

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

Adding to 115161506103 its reverse (301605161511), we get a palindrome (416766667614).

The spelling of 115161506103 in words is "one hundred fifteen billion, one hundred sixty-one million, five hundred six thousand, one hundred three".

Divisors: 1 3 7 21 233 699 1631 4893 23535971 70607913 164751797 494255391 5483881243 16451643729 38387168701 115161506103