Base | Representation |
---|---|
bin | 1100111000111000001… |
… | …0011011100101000001 |
3 | 210011112120201020011222 |
4 | 3032032002123211001 |
5 | 12111440120142032 |
6 | 245415530444425 |
7 | 21666102533060 |
oct | 3161602334501 |
9 | 704476636158 |
10 | 221426334017 |
11 | 859a7436069 |
12 | 36ab7293715 |
13 | 17b5a365a25 |
14 | aa079b21d7 |
15 | 5b5e537a12 |
hex | 338e09b941 |
221426334017 has 8 divisors (see below), whose sum is σ = 253061523456. Its totient is φ = 189791858592.
The previous prime is 221426334011. The next prime is 221426334023. The reversal of 221426334017 is 710433624122.
It is an interprime number because it is at equal distance from previous prime (221426334011) and next prime (221426334023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 221426334017 - 210 = 221426332993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (221426334011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1046528 + ... + 1240190.
It is an arithmetic number, because the mean of its divisors is an integer number (31632690432).
Almost surely, 2221426334017 is an apocalyptic number.
It is an amenable number.
221426334017 is a deficient number, since it is larger than the sum of its proper divisors (31635189439).
221426334017 is a wasteful number, since it uses less digits than its factorization.
221426334017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357007.
The product of its (nonzero) digits is 48384, while the sum is 35.
Adding to 221426334017 its reverse (710433624122), we get a palindrome (931859958139).
The spelling of 221426334017 in words is "two hundred twenty-one billion, four hundred twenty-six million, three hundred thirty-four thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •