Base | Representation |
---|---|
bin | 1001010111000… |
… | …11011010000000 |
3 | 12110202112112100 |
4 | 10223203122000 |
5 | 130100313310 |
6 | 11443030400 |
7 | 1642314003 |
oct | 453433200 |
9 | 173675470 |
10 | 78526080 |
11 | 40364896 |
12 | 2236b400 |
13 | 13365549 |
14 | a60153a |
15 | 6d61ec0 |
hex | 4ae3680 |
78526080 has 96 divisors (see below), whose sum is σ = 271180260. Its totient is φ = 20938752.
The previous prime is 78526061. The next prime is 78526153. The reversal of 78526080 is 8062587.
It can be written as a sum of positive squares in 2 ways, for example, as 78428736 + 97344 = 8856^2 + 312^2 .
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1057 + ... + 12576.
Almost surely, 278526080 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 78526080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135590130).
78526080 is an abundant number, since it is smaller than the sum of its proper divisors (192654180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
78526080 is a wasteful number, since it uses less digits than its factorization.
78526080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13658 (or 13643 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 36.
The square root of 78526080 is about 8861.4942306588. The cubic root of 78526080 is about 428.2242979577.
The spelling of 78526080 in words is "seventy-eight million, five hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •