Base | Representation |
---|---|
bin | 1110111101000010… |
… | …00001010000010001 |
3 | 202201111102001012112 |
4 | 13132201001100101 |
5 | 112420202241022 |
6 | 3404343235105 |
7 | 402642164156 |
oct | 73641012021 |
9 | 22644361175 |
10 | 8028165137 |
11 | 344a765323 |
12 | 1680748a95 |
13 | 9ac324b95 |
14 | 56231a22d |
15 | 31ec108e2 |
hex | 1de841411 |
8028165137 has 4 divisors (see below), whose sum is σ = 8028739056. Its totient is φ = 8027591220.
The previous prime is 8028165127. The next prime is 8028165191. The reversal of 8028165137 is 7315618208.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 8028165137 - 24 = 8028165121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 8028165094 and 8028165103.
It is not an unprimeable number, because it can be changed into a prime (8028165127) 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 3 ways as a sum of consecutive naturals, for example, 265439 + ... + 294132.
It is an arithmetic number, because the mean of its divisors is an integer number (2007184764).
Almost surely, 28028165137 is an apocalyptic number.
It is an amenable number.
8028165137 is a deficient number, since it is larger than the sum of its proper divisors (573919).
8028165137 is a wasteful number, since it uses less digits than its factorization.
8028165137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573918.
The product of its (nonzero) digits is 80640, while the sum is 41.
The square root of 8028165137 is about 89600.0286662901. The cubic root of 8028165137 is about 2002.3443456979.
The spelling of 8028165137 in words is "eight billion, twenty-eight million, one hundred sixty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •