Base | Representation |
---|---|
bin | 1001100010001000101100… |
… | …10001100101100110000100 |
3 | 2202020011000210210100001011 |
4 | 10301010112101211212010 |
5 | 10221433443411042324 |
6 | 112330440113412004 |
7 | 4262415111010000 |
oct | 461042621454604 |
9 | 82204023710034 |
10 | 20964109080964 |
11 | 6752913052275 |
12 | 2426b9986a004 |
13 | b90ba38c167a |
14 | 52694db23700 |
15 | 2654d0735c94 |
hex | 131116465984 |
20964109080964 has 135 divisors (see below), whose sum is σ = 45188698390647. Its totient is φ = 8508282071184.
The previous prime is 20964109080917. The next prime is 20964109081009. The reversal of 20964109080964 is 46908090146902.
The square root of 20964109080964 is 4578658.
It is a perfect power (a square), and thus also a powerful number.
It is a junction number, because it is equal to n+sod(n) for n = 20964109080899 and 20964109080908.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 8525459967 + ... + 8525462425.
Almost surely, 220964109080964 is an apocalyptic number.
20964109080964 is the 4578658-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20964109080964
20964109080964 is an abundant number, since it is smaller than the sum of its proper divisors (24224589309683).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20964109080964 is an frugal number, since it uses more digits than its factorization.
20964109080964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4988 (or 2487 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 58.
The spelling of 20964109080964 in words is "twenty trillion, nine hundred sixty-four billion, one hundred nine million, eighty thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •