Base | Representation |
---|---|
bin | 1001101011100001110100… |
… | …01010111100110110110100 |
3 | 2210101000001001102011110020 |
4 | 10311300322022330312310 |
5 | 10242230413432240322 |
6 | 113135011513525140 |
7 | 4324631405310363 |
oct | 465607212746664 |
9 | 83330031364406 |
10 | 21286833868212 |
11 | 6867771854580 |
12 | 24796457137b0 |
13 | bb545577ca43 |
14 | 538406d937da |
15 | 26dabce9005c |
hex | 135c3a2bcdb4 |
21286833868212 has 48 divisors (see below), whose sum is σ = 55649118528192. Its totient is φ = 6276216372480.
The previous prime is 21286833868129. The next prime is 21286833868219.
21286833868212 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×212868338682122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21286833868219) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2179236913 + ... + 2179246680.
It is an arithmetic number, because the mean of its divisors is an integer number (1159356636004).
Almost surely, 221286833868212 is an apocalyptic number.
21286833868212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21286833868212 is an abundant number, since it is smaller than the sum of its proper divisors (34362284659980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21286833868212 is a wasteful number, since it uses less digits than its factorization.
21286833868212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4358483648 (or 4358483646 counting only the distinct ones).
The product of its digits is 21233664, while the sum is 60.
The spelling of 21286833868212 in words is "twenty-one trillion, two hundred eighty-six billion, eight hundred thirty-three million, eight hundred sixty-eight thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •