Base | Representation |
---|---|
bin | 1001100011110100101101… |
… | …10011110010010000011011 |
3 | 2202102200201022010112210021 |
4 | 10301322112303302100123 |
5 | 10223411230111313334 |
6 | 112413230334331311 |
7 | 4266540144404434 |
oct | 461722663622033 |
9 | 82380638115707 |
10 | 21022100104219 |
11 | 6775471511375 |
12 | 2436282959b37 |
13 | b964b6080606 |
14 | 52969186248b |
15 | 266c769013b4 |
hex | 131e96cf241b |
21022100104219 has 2 divisors, whose sum is σ = 21022100104220. Its totient is φ = 21022100104218.
The previous prime is 21022100104217. The next prime is 21022100104267. The reversal of 21022100104219 is 91240100122012.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21022100104219 - 21 = 21022100104217 is a prime.
It is a super-2 number, since 2×210221001042192 (a number of 27 digits) contains 22 as substring.
Together with 21022100104217, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 21022100104193 and 21022100104202.
It is not a weakly prime, because it can be changed into another prime (21022100104217) by changing a digit.
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 as a sum of consecutive naturals, namely, 10511050052109 + 10511050052110.
It is an arithmetic number, because the mean of its divisors is an integer number (10511050052110).
Almost surely, 221022100104219 is an apocalyptic number.
21022100104219 is a deficient number, since it is larger than the sum of its proper divisors (1).
21022100104219 is an equidigital number, since it uses as much as digits as its factorization.
21022100104219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 21022100104219 in words is "twenty-one trillion, twenty-two billion, one hundred million, one hundred four thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •