Base | Representation |
---|---|
bin | 1001101101101110000011… |
… | …01100110111001111101000 |
3 | 2210122012101000112221122221 |
4 | 10312313001230313033220 |
5 | 10244444111231020222 |
6 | 113233342354323424 |
7 | 4333235205041212 |
oct | 466670154671750 |
9 | 83565330487587 |
10 | 21362122126312 |
11 | 6896697038190 |
12 | 2490157589574 |
13 | bbc5936a23a6 |
14 | 53bd0a0655b2 |
15 | 270a279970c7 |
hex | 136dc1b373e8 |
21362122126312 has 128 divisors (see below), whose sum is σ = 45569292595200. Its totient is φ = 9300432960000.
The previous prime is 21362122126307. The next prime is 21362122126337.
21362122126312 is nontrivially palindromic in base 10.
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, 135363612 + ... + 135521332.
It is an arithmetic number, because the mean of its divisors is an integer number (356010098400).
Almost surely, 221362122126312 is an apocalyptic number.
21362122126312 is a gapful number since it is divisible by the number (22) 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 21362122126312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22784646297600).
21362122126312 is an abundant number, since it is smaller than the sum of its proper divisors (24207170468888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21362122126312 is a wasteful number, since it uses less digits than its factorization.
21362122126312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158279 (or 158275 counting only the distinct ones).
The product of its digits is 20736, while the sum is 34.
The spelling of 21362122126312 in words is "twenty-one trillion, three hundred sixty-two billion, one hundred twenty-two million, one hundred twenty-six thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •