Base | Representation |
---|---|
bin | 11001110101000011010010… |
… | …00100000110111001000000 |
3 | 21110002212121212100200201111 |
4 | 30322201221010012321000 |
5 | 24421041121003104114 |
6 | 320444455054013104 |
7 | 14651356360624561 |
oct | 1472415104067100 |
9 | 243085555320644 |
10 | 56798410206784 |
11 | 17109085915044 |
12 | 6453ab47a7194 |
13 | 25900b455b39c |
14 | 10050b4564168 |
15 | 6876cc554bc4 |
hex | 33a869106e40 |
56798410206784 has 63 divisors (see below), whose sum is σ = 116466246495921. Its totient is φ = 27482197336320.
The previous prime is 56798410206767. The next prime is 56798410206809. The reversal of 56798410206784 is 48760201489765.
The square root of 56798410206784 is 7536472.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 39645559646784 + 17152850560000 = 6296472^2 + 4141600^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1869029862 + ... + 1869060250.
Almost surely, 256798410206784 is an apocalyptic number.
56798410206784 is the 7536472-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56798410206784
56798410206784 is an abundant number, since it is smaller than the sum of its proper divisors (59667836289137).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56798410206784 is an frugal number, since it uses more digits than its factorization.
56798410206784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60852 (or 30422 counting only the distinct ones).
The product of its (nonzero) digits is 162570240, while the sum is 67.
The spelling of 56798410206784 in words is "fifty-six trillion, seven hundred ninety-eight billion, four hundred ten million, two hundred six thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •