Base | Representation |
---|---|
bin | 1111000000010111… |
… | …00101111001010000 |
3 | 202210102222102000221 |
4 | 13200023211321100 |
5 | 112444330234410 |
6 | 3411222122424 |
7 | 403431512146 |
oct | 74013457120 |
9 | 22712872027 |
10 | 8056102480 |
11 | 3464507038 |
12 | 1689b80414 |
13 | 9b505705a |
14 | 565d0d596 |
15 | 3223cd4da |
hex | 1e02e5e50 |
8056102480 has 20 divisors (see below), whose sum is σ = 18730438452. Its totient is φ = 3222440960.
The previous prime is 8056102459. The next prime is 8056102487. The reversal of 8056102480 is 842016508.
It can be written as a sum of positive squares in 2 ways, for example, as 4867015696 + 3189086784 = 69764^2 + 56472^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8056102487) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50350561 + ... + 50350720.
Almost surely, 28056102480 is an apocalyptic number.
8056102480 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
8056102480 is an abundant number, since it is smaller than the sum of its proper divisors (10674335972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8056102480 is a wasteful number, since it uses less digits than its factorization.
8056102480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100701294 (or 100701288 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 34.
The square root of 8056102480 is about 89755.7935734513. The cubic root of 8056102480 is about 2004.6643202685.
Adding to 8056102480 its reverse (842016508), we get a palindrome (8898118988).
The spelling of 8056102480 in words is "eight billion, fifty-six million, one hundred two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •