Base | Representation |
---|---|
bin | 1111111100000100… |
… | …11001001101000001 |
3 | 211002100112000210102 |
4 | 13332002121031001 |
5 | 120011043221211 |
6 | 3533034212145 |
7 | 422023236155 |
oct | 77602311501 |
9 | 24070460712 |
10 | 8557007681 |
11 | 36a1231582 |
12 | 17a9884055 |
13 | a64a68171 |
14 | 5b265d065 |
15 | 351374a3b |
hex | 1fe099341 |
8557007681 has 8 divisors (see below), whose sum is σ = 9062793864. Its totient is φ = 8051491840.
The previous prime is 8557007633. The next prime is 8557007731. The reversal of 8557007681 is 1867007558.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 46022656 + 8510985025 = 6784^2 + 92255^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 8557007681 - 230 = 7483265857 is a prime.
It is a super-2 number, since 2×85570076812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (8557007881) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500 + ... + 130821.
It is an arithmetic number, because the mean of its divisors is an integer number (1132849233).
Almost surely, 28557007681 is an apocalyptic number.
It is an amenable number.
8557007681 is a deficient number, since it is larger than the sum of its proper divisors (505786183).
8557007681 is a wasteful number, since it uses less digits than its factorization.
8557007681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135171.
The product of its (nonzero) digits is 470400, while the sum is 47.
The square root of 8557007681 is about 92504.0954823082. The cubic root of 8557007681 is about 2045.3798535187.
The spelling of 8557007681 in words is "eight billion, five hundred fifty-seven million, seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •