Base | Representation |
---|---|
bin | 1111000000010101… |
… | …11011010010110101 |
3 | 202210102122112200022 |
4 | 13200022323102311 |
5 | 112444304143424 |
6 | 3411214254525 |
7 | 403430154344 |
oct | 74012732265 |
9 | 22712575608 |
10 | 8055927989 |
11 | 34643a7a2a |
12 | 1689ab7445 |
13 | 9b4cc57c5 |
14 | 565ca5b5b |
15 | 32239695e |
hex | 1e02bb4b5 |
8055927989 has 4 divisors (see below), whose sum is σ = 8529806124. Its totient is φ = 7582049856.
The previous prime is 8055927983. The next prime is 8055927991. The reversal of 8055927989 is 9897295508.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7433026225 + 622901764 = 86215^2 + 24958^2 .
It is a cyclic number.
It is not a de Polignac number, because 8055927989 - 216 = 8055862453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8055927983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 236939042 + ... + 236939075.
It is an arithmetic number, because the mean of its divisors is an integer number (2132451531).
Almost surely, 28055927989 is an apocalyptic number.
It is an amenable number.
8055927989 is a deficient number, since it is larger than the sum of its proper divisors (473878135).
8055927989 is a wasteful number, since it uses less digits than its factorization.
8055927989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473878134.
The product of its (nonzero) digits is 16329600, while the sum is 62.
The square root of 8055927989 is about 89754.8215362272. The cubic root of 8055927989 is about 2004.6498468343.
The spelling of 8055927989 in words is "eight billion, fifty-five million, nine hundred twenty-seven thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •