Base | Representation |
---|---|
bin | 1100001010101… |
… | …01000100011011 |
3 | 21010001012102200 |
4 | 12011111010123 |
5 | 202111412230 |
6 | 14043301243 |
7 | 2346332640 |
oct | 605250433 |
9 | 233035380 |
10 | 102060315 |
11 | 52679475 |
12 | 2a21a823 |
13 | 181b5526 |
14 | d7a9dc7 |
15 | 8e60160 |
hex | 615511b |
102060315 has 48 divisors (see below), whose sum is σ = 210981888. Its totient is φ = 44624448.
The previous prime is 102060313. The next prime is 102060317. The reversal of 102060315 is 513060201.
It is an interprime number because it is at equal distance from previous prime (102060313) and next prime (102060317).
It is not a de Polignac number, because 102060315 - 21 = 102060313 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102060311) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 202 + ... + 14288.
It is an arithmetic number, because the mean of its divisors is an integer number (4395456).
Almost surely, 2102060315 is an apocalyptic number.
102060315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102060315 is an abundant number, since it is smaller than the sum of its proper divisors (108921573).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102060315 is a wasteful number, since it uses less digits than its factorization.
102060315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14128 (or 14125 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 102060315 is about 10102.4905345167. The cubic root of 102060315 is about 467.3249499526.
It can be divided in two parts, 102060 and 315, that multiplied together give a square (32148900 = 56702).
The spelling of 102060315 in words is "one hundred two million, sixty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •