Search a number
-
+
102001315 = 51331223227
BaseRepresentation
bin1100001010001…
…10101010100011
321002221012111111
412011012222203
5202103020230
614042124151
72345665633
oct605065243
9232835444
10102001315
1152639109
122a1b0657
1318194710
14d7926c3
158e4c92a
hex6146aa3

102001315 has 32 divisors (see below), whose sum is σ = 137281536. Its totient is φ = 72247680.

The previous prime is 102001313. The next prime is 102001349. The reversal of 102001315 is 513100201.

It is not a de Polignac number, because 102001315 - 21 = 102001313 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2102001315 is an apocalyptic number.

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

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

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

The sum of its prime factors is 499.

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

The square root of 102001315 is about 10099.5700403532. The cubic root of 102001315 is about 467.2348807067.

Adding to 102001315 its reverse (513100201), we get a palindrome (615101516).

The spelling of 102001315 in words is "one hundred two million, one thousand, three hundred fifteen".

Divisors: 1 5 13 31 65 155 223 227 403 1115 1135 2015 2899 2951 6913 7037 14495 14755 34565 35185 50621 89869 91481 253105 449345 457405 658073 1569251 3290365 7846255 20400263 102001315