Base | Representation |
---|---|
bin | 1001101001010011000011… |
… | …11011111111000100101011 |
3 | 2210002200012201111200100002 |
4 | 10310221201323333010223 |
5 | 10240001433023404233 |
6 | 113035454424333215 |
7 | 4316246215052615 |
oct | 464514173770453 |
9 | 83080181450302 |
10 | 21210191622443 |
11 | 683821224999a |
12 | 246681631420b |
13 | bab16019bc65 |
14 | 534816149db5 |
15 | 26bad46816e8 |
hex | 134a61eff12b |
21210191622443 has 2 divisors, whose sum is σ = 21210191622444. Its totient is φ = 21210191622442.
The previous prime is 21210191622437. The next prime is 21210191622481. The reversal of 21210191622443 is 34422619101212.
It is an a-pointer prime, because the next prime (21210191622481) can be obtained adding 21210191622443 to its sum of digits (38).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21210191622443 - 242 = 16812145111339 is a prime.
It is a super-2 number, since 2×212101916224432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21210191622397 and 21210191622406.
It is not a weakly prime, because it can be changed into another prime (21210191622743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10605095811221 + 10605095811222.
It is an arithmetic number, because the mean of its divisors is an integer number (10605095811222).
Almost surely, 221210191622443 is an apocalyptic number.
21210191622443 is a deficient number, since it is larger than the sum of its proper divisors (1).
21210191622443 is an equidigital number, since it uses as much as digits as its factorization.
21210191622443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 38.
The spelling of 21210191622443 in words is "twenty-one trillion, two hundred ten billion, one hundred ninety-one million, six hundred twenty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •