Base | Representation |
---|---|
bin | 1100111000111011101… |
… | …1100111010001100101 |
3 | 210011120121220210202110 |
4 | 3032032323213101211 |
5 | 12112002434333013 |
6 | 245421224031233 |
7 | 21666344125041 |
oct | 3161673472145 |
9 | 704517823673 |
10 | 221441324133 |
11 | 85a04944397 |
12 | 36b00302519 |
13 | 17b604b3a13 |
14 | aa09995021 |
15 | 5b609e92c3 |
hex | 338eee7465 |
221441324133 has 4 divisors (see below), whose sum is σ = 295255098848. Its totient is φ = 147627549420.
The previous prime is 221441324053. The next prime is 221441324147. The reversal of 221441324133 is 331423144122.
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.
It is not a de Polignac number, because 221441324133 - 28 = 221441323877 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 221441324133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221441326133) 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, 36906887353 + ... + 36906887358.
It is an arithmetic number, because the mean of its divisors is an integer number (73813774712).
Almost surely, 2221441324133 is an apocalyptic number.
It is an amenable number.
221441324133 is a deficient number, since it is larger than the sum of its proper divisors (73813774715).
221441324133 is an equidigital number, since it uses as much as digits as its factorization.
221441324133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73813774714.
The product of its digits is 13824, while the sum is 30.
Adding to 221441324133 its reverse (331423144122), we get a palindrome (552864468255).
The spelling of 221441324133 in words is "two hundred twenty-one billion, four hundred forty-one million, three hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •