Base | Representation |
---|---|
bin | 101000001100010001111… |
… | …011100010010100010000 |
3 | 100210001010002000210002100 |
4 | 220030101323202110100 |
5 | 330223000441303211 |
6 | 5512455030520400 |
7 | 403355030236062 |
oct | 50142173422420 |
9 | 10701102023070 |
10 | 2761964791056 |
11 | 9753851360a9 |
12 | 387354506100 |
13 | 1705b5528943 |
14 | 97973579732 |
15 | 4bca2043156 |
hex | 28311ee2510 |
2761964791056 has 45 divisors (see below), whose sum is σ = 7729721165829. Its totient is φ = 920648282688.
The previous prime is 2761964791037. The next prime is 2761964791063. The reversal of 2761964791056 is 6501974691672.
The square root of 2761964791056 is 1661916.
It is a perfect power (a square), and thus also a powerful number.
2761964791056 is a `hidden beast` number, since 2 + 7 + 61 + 96 + 479 + 10 + 5 + 6 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2251620291600 + 510344499456 = 1500540^2 + 714384^2 .
It is a junction number, because it is equal to n+sod(n) for n = 2761964790984 and 2761964791002.
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, 19873746 + ... + 20012238.
Almost surely, 22761964791056 is an apocalyptic number.
2761964791056 is the 1661916-th square number.
It is an amenable number.
2761964791056 is an abundant number, since it is smaller than the sum of its proper divisors (4967756374773).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2761964791056 is an frugal number, since it uses more digits than its factorization.
2761964791056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277000 (or 138498 counting only the distinct ones).
The product of its (nonzero) digits is 34292160, while the sum is 63.
The spelling of 2761964791056 in words is "two trillion, seven hundred sixty-one billion, nine hundred sixty-four million, seven hundred ninety-one thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •