Search a number
-
+
10104013115 = 571777162457
BaseRepresentation
bin10010110100011111…
…10000000100111011
3222002011111001021222
421122033300010323
5131143111404430
64350340022255
7505246460120
oct113217600473
928064431258
1010104013115
1143154a7669
121b5b99198b
13c504077b1
146bbcba747
153e20a69e5
hex25a3f013b

10104013115 has 16 divisors (see below), whose sum is σ = 13864815552. Its totient is φ = 6924524544.

The previous prime is 10104013109. The next prime is 10104013159. The reversal of 10104013115 is 51131040101.

10104013115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 10104013115 - 214 = 10103996731 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10104013093 and 10104013102.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 19034 + ... + 143423.

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

Almost surely, 210104013115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 164246.

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

Adding to 10104013115 its reverse (51131040101), we get a palindrome (61235053216).

The spelling of 10104013115 in words is "ten billion, one hundred four million, thirteen thousand, one hundred fifteen".

Divisors: 1 5 7 35 1777 8885 12439 62195 162457 812285 1137199 5685995 288686089 1443430445 2020802623 10104013115