Base | Representation |
---|---|
bin | 1001101100100011010110… |
… | …11011011110000001101101 |
3 | 2210111100212020100220002112 |
4 | 10312101223123132001231 |
5 | 10243314444111122313 |
6 | 113203111211133405 |
7 | 4330315350544304 |
oct | 466215333360155 |
9 | 83440766326075 |
10 | 21322020020333 |
11 | 688068848a43a |
12 | 2484425444265 |
13 | bb887241c8b6 |
14 | 539dc40b943b |
15 | 26e97c0418a8 |
hex | 13646b6de06d |
21322020020333 has 2 divisors, whose sum is σ = 21322020020334. Its totient is φ = 21322020020332.
The previous prime is 21322020020269. The next prime is 21322020020387. The reversal of 21322020020333 is 33302002022312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21278827958404 + 43192061929 = 4612898^2 + 207827^2 .
It is a cyclic number.
It is not a de Polignac number, because 21322020020333 - 26 = 21322020020269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21322020020299 and 21322020020308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21322020020233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10661010010166 + 10661010010167.
It is an arithmetic number, because the mean of its divisors is an integer number (10661010010167).
Almost surely, 221322020020333 is an apocalyptic number.
It is an amenable number.
21322020020333 is a deficient number, since it is larger than the sum of its proper divisors (1).
21322020020333 is an equidigital number, since it uses as much as digits as its factorization.
21322020020333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 21322020020333 its reverse (33302002022312), we get a palindrome (54624022042645).
The spelling of 21322020020333 in words is "twenty-one trillion, three hundred twenty-two billion, twenty million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •