Base | Representation |
---|---|
bin | 1001010010100110110110… |
… | …10110110010011111100000 |
3 | 2200100010210210011120020001 |
4 | 10221103123112302133200 |
5 | 10134213223412102224 |
6 | 111241355044025344 |
7 | 4206025641065212 |
oct | 451233326623740 |
9 | 80303723146201 |
10 | 20430544644064 |
11 | 65675aa912625 |
12 | 235b6b0092254 |
13 | b52790aa0859 |
14 | 508bb4d225b2 |
15 | 2566a30de544 |
hex | 1294db5b27e0 |
20430544644064 has 96 divisors (see below), whose sum is σ = 42083810949600. Its totient is φ = 9753532416000.
The previous prime is 20430544644047. The next prime is 20430544644157. The reversal of 20430544644064 is 46044644503402.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39491064 + ... + 40005064.
It is an arithmetic number, because the mean of its divisors is an integer number (438373030725).
Almost surely, 220430544644064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20430544644064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21041905474800).
20430544644064 is an abundant number, since it is smaller than the sum of its proper divisors (21653266305536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20430544644064 is a wasteful number, since it uses less digits than its factorization.
20430544644064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 514676 (or 514668 counting only the distinct ones).
The product of its (nonzero) digits is 4423680, while the sum is 46.
The spelling of 20430544644064 in words is "twenty trillion, four hundred thirty billion, five hundred forty-four million, six hundred forty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •