Base | Representation |
---|---|
bin | 11011111000001100111010… |
… | …10010010110000011101111 |
3 | 22001001200011102212202201000 |
4 | 31330012131102112003233 |
5 | 31013404020001011123 |
6 | 334214554342251343 |
7 | 15625055535030132 |
oct | 1574063522260357 |
9 | 261050142782630 |
10 | 61304707047663 |
11 | 185961a8a10932 |
12 | 6a6131a426b53 |
13 | 2829016c03521 |
14 | 111d2410c6219 |
15 | 714a21d63b43 |
hex | 37c19d4960ef |
61304707047663 has 8 divisors (see below), whose sum is σ = 90821788218800. Its totient is φ = 40869804698424.
The previous prime is 61304707047641. The next prime is 61304707047721. The reversal of 61304707047663 is 36674070740316.
61304707047663 is a `hidden beast` number, since 6 + 1 + 3 + 0 + 47 + 0 + 70 + 476 + 63 = 666.
It is not a de Polignac number, because 61304707047663 - 230 = 61303633305839 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61304703047663) 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, 1135272352708 + ... + 1135272352761.
It is an arithmetic number, because the mean of its divisors is an integer number (11352723527350).
Almost surely, 261304707047663 is an apocalyptic number.
61304707047663 is a deficient number, since it is larger than the sum of its proper divisors (29517081171137).
61304707047663 is a wasteful number, since it uses less digits than its factorization.
61304707047663 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2270544705478 (or 2270544705472 counting only the distinct ones).
The product of its (nonzero) digits is 10668672, while the sum is 54.
Adding to 61304707047663 its reverse (36674070740316), we get a palindrome (97978777787979).
The spelling of 61304707047663 in words is "sixty-one trillion, three hundred four billion, seven hundred seven million, forty-seven thousand, six hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •