Search a number
-
+
10100152115 = 5171071110517
BaseRepresentation
bin10010110100000010…
…00001011100110011
3222001220012212222222
421122001001130303
5131141114331430
64350121151255
7505201606424
oct113201013463
928056185888
1010100152115
1143132aa859
121b5a62b52b
13c4c685291
146bb59364b
153e1a929e5
hex25a041733

10100152115 has 16 divisors (see below), whose sum is σ = 12953081952. Its totient is φ = 7533740544.

The previous prime is 10100152079. The next prime is 10100152123. The reversal of 10100152115 is 51125100101.

It is a cyclic number.

It is not a de Polignac number, because 10100152115 - 218 = 10099889971 is a prime.

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

It is a Harshad number since it is a multiple of its sum of digits (17).

It is a Duffinian number.

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

It is an unprimeable number.

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

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

Almost surely, 210100152115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1110646.

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

Adding to 10100152115 its reverse (51125100101), we get a palindrome (61225252216).

The spelling of 10100152115 in words is "ten billion, one hundred million, one hundred fifty-two thousand, one hundred fifteen".

Divisors: 1 5 17 85 107 535 1819 9095 1110517 5552585 18878789 94393945 118825319 594126595 2020030423 10100152115