Base | Representation |
---|---|
bin | 1100110111011100011… |
… | …0000100100011110101 |
3 | 210010112202102011220121 |
4 | 3031313012010203311 |
5 | 12110143100143331 |
6 | 245313420331541 |
7 | 21653420001331 |
oct | 3156706044365 |
9 | 703482364817 |
10 | 221041412341 |
11 | 8581a129782 |
12 | 36a0a3a3bb1 |
13 | 17ac86a3619 |
14 | a9ac8147c1 |
15 | 5b3a851c11 |
hex | 33771848f5 |
221041412341 has 4 divisors (see below), whose sum is σ = 221046217792. Its totient is φ = 221036606892.
The previous prime is 221041412311. The next prime is 221041412387. The reversal of 221041412341 is 143214140122.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 143214140122 = 2 ⋅71607070061.
It is a cyclic number.
It is not a de Polignac number, because 221041412341 - 27 = 221041412213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221041412311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2333055 + ... + 2425948.
It is an arithmetic number, because the mean of its divisors is an integer number (55261554448).
Almost surely, 2221041412341 is an apocalyptic number.
It is an amenable number.
221041412341 is a deficient number, since it is larger than the sum of its proper divisors (4805451).
221041412341 is an equidigital number, since it uses as much as digits as its factorization.
221041412341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4805450.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 221041412341 its reverse (143214140122), we get a palindrome (364255552463).
The spelling of 221041412341 in words is "two hundred twenty-one billion, forty-one million, four hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •