Base | Representation |
---|---|
bin | 1001100110110001000100… |
… | …01101110111001110101001 |
3 | 2202210100201202010010211202 |
4 | 10303120202031313032221 |
5 | 10232040330121034121 |
6 | 112531512541533545 |
7 | 4310050106616365 |
oct | 463304215671651 |
9 | 82710652103752 |
10 | 21123223221161 |
11 | 6804343910896 |
12 | 24519a48742b5 |
13 | ba2bb0475a99 |
14 | 530525b1c2a5 |
15 | 2696e453b40b |
hex | 1336223773a9 |
21123223221161 has 2 divisors, whose sum is σ = 21123223221162. Its totient is φ = 21123223221160.
The previous prime is 21123223221019. The next prime is 21123223221169. The reversal of 21123223221161 is 16112232232112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13825985425561 + 7297237795600 = 3718331^2 + 2701340^2 .
It is a cyclic number.
It is not a de Polignac number, because 21123223221161 - 230 = 21122149479337 is a prime.
It is not a weakly prime, because it can be changed into another prime (21123223221169) 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, 10561611610580 + 10561611610581.
It is an arithmetic number, because the mean of its divisors is an integer number (10561611610581).
Almost surely, 221123223221161 is an apocalyptic number.
It is an amenable number.
21123223221161 is a deficient number, since it is larger than the sum of its proper divisors (1).
21123223221161 is an equidigital number, since it uses as much as digits as its factorization.
21123223221161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 21123223221161 its reverse (16112232232112), we get a palindrome (37235455453273).
The spelling of 21123223221161 in words is "twenty-one trillion, one hundred twenty-three billion, two hundred twenty-three million, two hundred twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •