Base | Representation |
---|---|
bin | 100100010110110110… |
… | …1110110111100000000 |
3 | 21110112021112110020020 |
4 | 1020231231312330000 |
5 | 2234400030020202 |
6 | 55511240213440 |
7 | 5432543341233 |
oct | 1105555667400 |
9 | 243467473206 |
10 | 78076407552 |
11 | 30126107660 |
12 | 1316b76a280 |
13 | 7493760930 |
14 | 3ac94cd41a |
15 | 206e6a05bc |
hex | 122db76f00 |
78076407552 has 1152 divisors, whose sum is σ = 284823060480. Its totient is φ = 18579456000.
The previous prime is 78076407551. The next prime is 78076407581. The reversal of 78076407552 is 25570467087.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a junction number, because it is equal to n+sod(n) for n = 78076407495 and 78076407504.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (78076407551) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 1099667677 + ... + 1099667747.
It is an arithmetic number, because the mean of its divisors is an integer number (247242240).
Almost surely, 278076407552 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 78076407552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142411530240).
78076407552 is an abundant number, since it is smaller than the sum of its proper divisors (206746652928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
78076407552 is a wasteful number, since it uses less digits than its factorization.
78076407552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181 (or 167 counting only the distinct ones).
The product of its (nonzero) digits is 3292800, while the sum is 51.
The spelling of 78076407552 in words is "seventy-eight billion, seventy-six million, four hundred seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •