Base | Representation |
---|---|
bin | 1001100100110011111001… |
… | …01110000101000001111000 |
3 | 2202112221021101102110102211 |
4 | 10302121330232011001320 |
5 | 10224440213131422000 |
6 | 112441000353304504 |
7 | 4302150600060142 |
oct | 462317456050170 |
9 | 82487241373384 |
10 | 21056022139000 |
11 | 6788899628162 |
12 | 244096b265134 |
13 | b99760b69c44 |
14 | 52b18cb27c92 |
15 | 267aae9ee7ba |
hex | 13267cb85078 |
21056022139000 has 128 divisors (see below), whose sum is σ = 49364346470400. Its totient is φ = 8406478080000.
The previous prime is 21056022138997. The next prime is 21056022139027. The reversal of 21056022139000 is 93122065012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2570624905 + ... + 2570633095.
It is an arithmetic number, because the mean of its divisors is an integer number (385658956800).
Almost surely, 221056022139000 is an apocalyptic number.
21056022139000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21056022139000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24682173235200).
21056022139000 is an abundant number, since it is smaller than the sum of its proper divisors (28308324331400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21056022139000 is a wasteful number, since it uses less digits than its factorization.
21056022139000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12762 (or 12748 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 21056022139000 in words is "twenty-one trillion, fifty-six billion, twenty-two million, one hundred thirty-nine thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •