Base | Representation |
---|---|
bin | 110010010100011000011110… |
… | …101101000001100101001101 |
3 | 1002000120100201120111110210211 |
4 | 302110120132231001211031 |
5 | 213001312021000410013 |
6 | 2102401110020002421 |
7 | 64420420433610103 |
oct | 6224303655014515 |
9 | 1060510646443724 |
10 | 221303000013133 |
11 | 64572091171875 |
12 | 209a2006b30411 |
13 | 9663a2505753c |
14 | 3c9119da37c73 |
15 | 1a8b8eb3e323d |
hex | c9461eb4194d |
221303000013133 has 2 divisors, whose sum is σ = 221303000013134. Its totient is φ = 221303000013132.
The previous prime is 221303000013131. The next prime is 221303000013163. The reversal of 221303000013133 is 331310000303122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 196637741926564 + 24665258086569 = 14022758^2 + 4966413^2 .
It is a cyclic number.
It is not a de Polignac number, because 221303000013133 - 21 = 221303000013131 is a prime.
Together with 221303000013131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221303000013131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110651500006566 + 110651500006567.
It is an arithmetic number, because the mean of its divisors is an integer number (110651500006567).
Almost surely, 2221303000013133 is an apocalyptic number.
It is an amenable number.
221303000013133 is a deficient number, since it is larger than the sum of its proper divisors (1).
221303000013133 is an equidigital number, since it uses as much as digits as its factorization.
221303000013133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 221303000013133 its reverse (331310000303122), we get a palindrome (552613000316255).
The spelling of 221303000013133 in words is "two hundred twenty-one trillion, three hundred three billion, thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •