Base | Representation |
---|---|
bin | 1001111100101100100011… |
… | …01100111011111110100000 |
3 | 2212110101121201220111222212 |
4 | 10332112101230323332200 |
5 | 10331412002001233343 |
6 | 114310005001021252 |
7 | 4415353224421631 |
oct | 476262154737640 |
9 | 85411551814885 |
10 | 21876712914848 |
11 | 6a74953130000 |
12 | 2553a2aa84828 |
13 | c28c71650c3c |
14 | 558ba4dcb888 |
15 | 27e0e450bc18 |
hex | 13e591b3bfa0 |
21876712914848 has 180 divisors, whose sum is σ = 48955041850050. Its totient is φ = 9622989446400.
The previous prime is 21876712914841. The next prime is 21876712914883. The reversal of 21876712914848 is 84841921767812.
It can be written as a sum of positive squares in only one way, i.e., 17273233707664 + 4603479207184 = 4156108^2 + 2145572^2 .
It is not an unprimeable number, because it can be changed into a prime (21876712914841) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 450215738 + ... + 450264326.
Almost surely, 221876712914848 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 21876712914848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24477520925025).
21876712914848 is an abundant number, since it is smaller than the sum of its proper divisors (27078328935202).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21876712914848 is an frugal number, since it uses more digits than its factorization.
21876712914848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48705 (or 48633 counting only the distinct ones).
The product of its digits is 86704128, while the sum is 68.
The spelling of 21876712914848 in words is "twenty-one trillion, eight hundred seventy-six billion, seven hundred twelve million, nine hundred fourteen thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •