Base | Representation |
---|---|
bin | 1100001010010… |
… | …00010111111001 |
3 | 21002221120002200 |
4 | 12011020113321 |
5 | 202103231223 |
6 | 14042220413 |
7 | 2346025221 |
oct | 605102771 |
9 | 232846080 |
10 | 102008313 |
11 | 526433a0 |
12 | 2a1b4709 |
13 | 18197964 |
14 | d795081 |
15 | 8e4ea43 |
hex | 61485f9 |
102008313 has 24 divisors (see below), whose sum is σ = 170198496. Its totient is φ = 58185600.
The previous prime is 102008303. The next prime is 102008323. The reversal of 102008313 is 313800201.
It is an interprime number because it is at equal distance from previous prime (102008303) and next prime (102008323).
It is not a de Polignac number, because 102008313 - 28 = 102008057 is a prime.
It is a super-2 number, since 2×1020083132 = 20811391842211938, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102008303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 28623 + ... + 31988.
It is an arithmetic number, because the mean of its divisors is an integer number (7091604).
Almost surely, 2102008313 is an apocalyptic number.
It is an amenable number.
102008313 is a deficient number, since it is larger than the sum of its proper divisors (68190183).
102008313 is a wasteful number, since it uses less digits than its factorization.
102008313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60645 (or 60642 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 102008313 is about 10099.9164848032. The cubic root of 102008313 is about 467.2455656504.
Adding to 102008313 its reverse (313800201), we get a palindrome (415808514).
The spelling of 102008313 in words is "one hundred two million, eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •