Search a number
-
+
10115115105 = 354347333667
BaseRepresentation
bin10010110101110100…
…00110100001100001
3222002221101002100210
421122322012201201
5131203432140410
64351414004333
7505443026334
oct113272064141
928087332323
1010115115105
11432079a767
121b636466a9
13c527c3b14
146bd56a61b
153e304b220
hex25ae86861

10115115105 has 32 divisors (see below), whose sum is σ = 16912963584. Its totient is φ = 5157141696.

The previous prime is 10115115091. The next prime is 10115115113. The reversal of 10115115105 is 50151151101.

It is not a de Polignac number, because 10115115105 - 215 = 10115082337 is a prime.

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

It is a Curzon number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 136519 + ... + 197148.

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

Almost surely, 210115115105 is an apocalyptic number.

10115115105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 333765.

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

Adding to 10115115105 its reverse (50151151101), we get a palindrome (60266266206).

The spelling of 10115115105 in words is "ten billion, one hundred fifteen million, one hundred fifteen thousand, one hundred five".

Divisors: 1 3 5 15 43 47 129 141 215 235 645 705 2021 6063 10105 30315 333667 1001001 1668335 5005005 14347681 15682349 43043043 47047047 71738405 78411745 215215215 235235235 674341007 2023023021 3371705035 10115115105