Base | Representation |
---|---|
bin | 1001001100000… |
… | …10101110000000 |
3 | 12101001010220100 |
4 | 10212002232000 |
5 | 124213101342 |
6 | 11352042400 |
7 | 1624116216 |
oct | 446025600 |
9 | 171033810 |
10 | 77081472 |
11 | 3a5684a6 |
12 | 21993400 |
13 | 12c7ab50 |
14 | a346cb6 |
15 | 6b78e4c |
hex | 4982b80 |
77081472 has 96 divisors (see below), whose sum is σ = 238918680. Its totient is φ = 23712768.
The previous prime is 77081467. The next prime is 77081489. The reversal of 77081472 is 27418077.
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 a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12403 + ... + 17549.
Almost surely, 277081472 is an apocalyptic number.
77081472 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 77081472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119459340).
77081472 is an abundant number, since it is smaller than the sum of its proper divisors (161837208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
77081472 is a wasteful number, since it uses less digits than its factorization.
77081472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5180 (or 5165 counting only the distinct ones).
The product of its (nonzero) digits is 21952, while the sum is 36.
The square root of 77081472 is about 8779.6054581057. The cubic root of 77081472 is about 425.5820803882.
It can be divided in two parts, 7708 and 1472, that added together give a triangular number (9180 = T135).
The spelling of 77081472 in words is "seventy-seven million, eighty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •