[go: up one dir, main page]

Search a number
-
+
15100113 = 374715299
BaseRepresentation
bin111001100110…
…100011010001
31001102011110110
4321212203101
512331200423
61255351533
7242230440
oct71464321
931364413
1015100113
118583a36
1250825a9
1331890a2
142010d57
1514d4193
hexe668d1

15100113 has 16 divisors (see below), whose sum is σ = 23500800. Its totient is φ = 8444496.

The previous prime is 15100091. The next prime is 15100133. The reversal of 15100113 is 31100151.

15100113 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 15100113 - 25 = 15100081 is a prime.

It is a super-2 number, since 2×151001132 = 456026825225538, which contains 22 as substring.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (15100133) 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, 6663 + ... + 8636.

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

Almost surely, 215100113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15356.

The product of its (nonzero) digits is 15, while the sum is 12.

The square root of 15100113 is about 3885.8863853695. The cubic root of 15100113 is about 247.1686577234.

Adding to 15100113 its reverse (31100151), we get a palindrome (46200264).

It can be divided in two parts, 15 and 100113, that added together give a triangular number (100128 = T447).

The spelling of 15100113 in words is "fifteen million, one hundred thousand, one hundred thirteen".

Divisors: 1 3 7 21 47 141 329 987 15299 45897 107093 321279 719053 2157159 5033371 15100113