Base | Representation |
---|---|
bin | 10001110110011011110001… |
… | …111111101101000101000101 |
3 | 101021222020111201120021010111 |
4 | 101312123301333231011011 |
5 | 40242231300343320221 |
6 | 434545500154553021 |
7 | 22351656230406646 |
oct | 2166336177550505 |
9 | 337866451507114 |
10 | 78507472245061 |
11 | 230189174400a2 |
12 | 897b335738771 |
13 | 34a62b88397c2 |
14 | 1555ad38936cd |
15 | 91225d58cbe1 |
hex | 4766f1fed145 |
78507472245061 has 8 divisors (see below), whose sum is σ = 80422460927424. Its totient is φ = 76592491766880.
The previous prime is 78507472245047. The next prime is 78507472245071. The reversal of 78507472245061 is 16054227470587.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 78507472245061 - 27 = 78507472244933 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 78507472244987 and 78507472245005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (78507472245071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20239746 + ... + 23804668.
It is an arithmetic number, because the mean of its divisors is an integer number (10052807615928).
Almost surely, 278507472245061 is an apocalyptic number.
It is an amenable number.
78507472245061 is a deficient number, since it is larger than the sum of its proper divisors (1914988682363).
78507472245061 is a wasteful number, since it uses less digits than its factorization.
78507472245061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4102091.
The product of its (nonzero) digits is 26342400, while the sum is 58.
The spelling of 78507472245061 in words is "seventy-eight trillion, five hundred seven billion, four hundred seventy-two million, two hundred forty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •