Base | Representation |
---|---|
bin | 101001000001111111100… |
… | …0011000010111000010000 |
3 | 201222002221211211210202100 |
4 | 1102003333003002320100 |
5 | 1214343214134040111 |
6 | 15554351521320400 |
7 | 1121265342535011 |
oct | 122037703027020 |
9 | 21862854753670 |
10 | 5639276080656 |
11 | 1884670371849 |
12 | 770b1a196100 |
13 | 31ba20b0b58a |
14 | 156d29dd5008 |
15 | 9ba5572b756 |
hex | 520ff0c2e10 |
5639276080656 has 45 divisors (see below), whose sum is σ = 15782220449229. Its totient is φ = 1879749194688.
The previous prime is 5639276080639. The next prime is 5639276080687. The reversal of 5639276080656 is 6560806729365.
The square root of 5639276080656 is 2374716.
It is a perfect power (a square), and thus also a powerful number.
5639276080656 is a `hidden beast` number, since 56 + 392 + 7 + 60 + 80 + 65 + 6 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4515710000400 + 1123566080256 = 2125020^2 + 1059984^2 .
It is a junction number, because it is equal to n+sod(n) for n = 5639276080593 and 5639276080602.
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, 28397646 + ... + 28595538.
Almost surely, 25639276080656 is an apocalyptic number.
5639276080656 is the 2374716-th square number.
It is an amenable number.
5639276080656 is an abundant number, since it is smaller than the sum of its proper divisors (10142944368573).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5639276080656 is an frugal number, since it uses more digits than its factorization.
5639276080656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395800 (or 197898 counting only the distinct ones).
The product of its (nonzero) digits is 97977600, while the sum is 63.
The spelling of 5639276080656 in words is "five trillion, six hundred thirty-nine billion, two hundred seventy-six million, eighty thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •