Base | Representation |
---|---|
bin | 1100111000110111011… |
… | …0111010010110111001 |
3 | 210011112101000210222212 |
4 | 3032031312322112321 |
5 | 12111433332024421 |
6 | 245415342024505 |
7 | 21666035055314 |
oct | 3161566722671 |
9 | 704471023885 |
10 | 221423314361 |
11 | 859a5763387 |
12 | 36ab6278135 |
13 | 17b59849452 |
14 | aa0742797b |
15 | 5b5e13ce5b |
hex | 338ddba5b9 |
221423314361 has 2 divisors, whose sum is σ = 221423314362. Its totient is φ = 221423314360.
The previous prime is 221423314319. The next prime is 221423314373. The reversal of 221423314361 is 163413324122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 203902821136 + 17520493225 = 451556^2 + 132365^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221423314361 is a prime.
It is a super-2 number, since 2×2214233143612 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221423314661) 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, 110711657180 + 110711657181.
It is an arithmetic number, because the mean of its divisors is an integer number (110711657181).
Almost surely, 2221423314361 is an apocalyptic number.
It is an amenable number.
221423314361 is a deficient number, since it is larger than the sum of its proper divisors (1).
221423314361 is an equidigital number, since it uses as much as digits as its factorization.
221423314361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20736, while the sum is 32.
Adding to 221423314361 its reverse (163413324122), we get a palindrome (384836638483).
The spelling of 221423314361 in words is "two hundred twenty-one billion, four hundred twenty-three million, three hundred fourteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •