Base | Representation |
---|---|
bin | 1111000101110101… |
… | …01011110101100001 |
3 | 202220122100100100210 |
4 | 13202322223311201 |
5 | 113043103031032 |
6 | 3415542004333 |
7 | 404526611064 |
oct | 74272536541 |
9 | 22818310323 |
10 | 8102002017 |
11 | 348840703a |
12 | 16a14166a9 |
13 | 9c1707c45 |
14 | 56c05a8db |
15 | 3264482cc |
hex | 1e2eabd61 |
8102002017 has 8 divisors (see below), whose sum is σ = 10950651424. Its totient is φ = 5327343648.
The previous prime is 8102001977. The next prime is 8102002061. The reversal of 8102002017 is 7102002018.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 8102002017 - 216 = 8101936481 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8102001984 and 8102002002.
It is not an unprimeable number, because it can be changed into a prime (8102002417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18497503 + ... + 18497940.
It is an arithmetic number, because the mean of its divisors is an integer number (1368831428).
Almost surely, 28102002017 is an apocalyptic number.
It is an amenable number.
8102002017 is a deficient number, since it is larger than the sum of its proper divisors (2848649407).
8102002017 is a wasteful number, since it uses less digits than its factorization.
8102002017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36995519.
The product of its (nonzero) digits is 224, while the sum is 21.
The square root of 8102002017 is about 90011.1216294964. The cubic root of 8102002017 is about 2008.4642954001.
Subtracting from 8102002017 its reverse (7102002018), we obtain a palindrome (999999999).
The spelling of 8102002017 in words is "eight billion, one hundred two million, two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •