Base | Representation |
---|---|
bin | 1001011011001… |
… | …01110010100000 |
3 | 12111202200002220 |
4 | 10231211302200 |
5 | 130214411003 |
6 | 11502311040 |
7 | 1650000000 |
oct | 455456240 |
9 | 174680086 |
10 | 79060128 |
11 | 4069a054 |
12 | 22588480 |
13 | 134c1654 |
14 | a700000 |
15 | 6e1a353 |
hex | 4b65ca0 |
79060128 has 96 divisors (see below), whose sum is σ = 242121600. Its totient is φ = 22588608.
The previous prime is 79060103. The next prime is 79060129. The reversal of 79060128 is 82106097.
It is a tau number, because it is divible by the number of its divisors (96).
It is a nialpdrome in base 14.
It is not an unprimeable number, because it can be changed into a prime (79060129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11294301 + ... + 11294307.
It is an arithmetic number, because the mean of its divisors is an integer number (2522100).
Almost surely, 279060128 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 79060128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121060800).
79060128 is an abundant number, since it is smaller than the sum of its proper divisors (163061472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
79060128 is an frugal number, since it uses more digits than its factorization.
79060128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62 (or 12 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 33.
The square root of 79060128 is about 8891.5762382156. The cubic root of 79060128 is about 429.1928757090.
Multiplying 79060128 by its product of nonzero digits (6048), we get a square (478155654144 = 6914882).
The spelling of 79060128 in words is "seventy-nine million, sixty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •