Base | Representation |
---|---|
bin | 1001011111100110001100… |
… | …01110010111010001000001 |
3 | 2201220210211201212211102101 |
4 | 10233303012032113101001 |
5 | 10214021310334301031 |
6 | 112222411122550401 |
7 | 4253206135060642 |
oct | 457630616272101 |
9 | 81823751784371 |
10 | 20876866712641 |
11 | 6719914000725 |
12 | 24120b0508401 |
13 | b858ac1b3b14 |
14 | 52263517b6c9 |
15 | 2630c6525361 |
hex | 12fcc6397441 |
20876866712641 has 9 divisors (see below), whose sum is σ = 21572184493089. Its totient is φ = 20203282325700.
The previous prime is 20876866712629. The next prime is 20876866712687. The reversal of 20876866712641 is 14621766867802.
The square root of 20876866712641 is 4569121.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 20876866712641 - 211 = 20876866710593 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20876866710641) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 141569056 + ... + 141716446.
It is an arithmetic number, because the mean of its divisors is an integer number (2396909388121).
Almost surely, 220876866712641 is an apocalyptic number.
20876866712641 is the 4569121-st square number.
20876866712641 is the 2284561-st centered octagonal number.
It is an amenable number.
20876866712641 is a deficient number, since it is larger than the sum of its proper divisors (695317780448).
20876866712641 is an frugal number, since it uses more digits than its factorization.
20876866712641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294844 (or 147422 counting only the distinct ones).
The product of its (nonzero) digits is 65028096, while the sum is 64.
The spelling of 20876866712641 in words is "twenty trillion, eight hundred seventy-six billion, eight hundred sixty-six million, seven hundred twelve thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •