Base | Representation |
---|---|
bin | 1001101001011101111010… |
… | …10110000001110000011101 |
3 | 2210010020020220220012121202 |
4 | 10310232331112001300131 |
5 | 10240100402124040013 |
6 | 113042301034005245 |
7 | 4316543520501404 |
oct | 464567526016035 |
9 | 83106226805552 |
10 | 21216020143133 |
11 | 683a7332a7842 |
12 | 2467982276825 |
13 | bab87b88827a |
14 | 534c0a27c63b |
15 | 26bd261e5858 |
hex | 134bbd581c1d |
21216020143133 has 2 divisors, whose sum is σ = 21216020143134. Its totient is φ = 21216020143132.
The previous prime is 21216020143121. The next prime is 21216020143183. The reversal of 21216020143133 is 33134102061212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19994106561529 + 1221913581604 = 4471477^2 + 1105402^2 .
It is a cyclic number.
It is not a de Polignac number, because 21216020143133 - 26 = 21216020143069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21216020143096 and 21216020143105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21216020143183) 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, 10608010071566 + 10608010071567.
It is an arithmetic number, because the mean of its divisors is an integer number (10608010071567).
Almost surely, 221216020143133 is an apocalyptic number.
It is an amenable number.
21216020143133 is a deficient number, since it is larger than the sum of its proper divisors (1).
21216020143133 is an equidigital number, since it uses as much as digits as its factorization.
21216020143133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 29.
The spelling of 21216020143133 in words is "twenty-one trillion, two hundred sixteen billion, twenty million, one hundred forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •