Base | Representation |
---|---|
bin | 1100111000011111010… |
… | …1010011100111001111 |
3 | 210011021022211012121220 |
4 | 3032013311103213033 |
5 | 12111231442331343 |
6 | 245401331254423 |
7 | 21663366626343 |
oct | 3160765234717 |
9 | 704238735556 |
10 | 221322230223 |
11 | 859536a1376 |
12 | 36a8844a413 |
13 | 17b41916353 |
14 | a9d7c33623 |
15 | 5b55322183 |
hex | 3387d539cf |
221322230223 has 32 divisors (see below), whose sum is σ = 318435448320. Its totient is φ = 136228055040.
The previous prime is 221322230221. The next prime is 221322230237. The reversal of 221322230223 is 322032223122.
It is not a de Polignac number, because 221322230223 - 21 = 221322230221 is a prime.
It is a super-2 number, since 2×2213222302232 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 221322230193 and 221322230202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221322230221) 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 in 31 ways as a sum of consecutive naturals, for example, 689118 + ... + 957876.
It is an arithmetic number, because the mean of its divisors is an integer number (9951107760).
Almost surely, 2221322230223 is an apocalyptic number.
221322230223 is a deficient number, since it is larger than the sum of its proper divisors (97113218097).
221322230223 is a wasteful number, since it uses less digits than its factorization.
221322230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269087.
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 221322230223 its reverse (322032223122), we get a palindrome (543354453345).
The spelling of 221322230223 in words is "two hundred twenty-one billion, three hundred twenty-two million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •