Base | Representation |
---|---|
bin | 1100111000111110101… |
… | …1111111010110000001 |
3 | 210011121111210002111122 |
4 | 3032033223333112001 |
5 | 12112014211140013 |
6 | 245422355522025 |
7 | 21666556663250 |
oct | 3161753772601 |
9 | 704544702448 |
10 | 221454005633 |
11 | 85a11016173 |
12 | 36b045b9315 |
13 | 17b63003c73 |
14 | aa0b536797 |
15 | 5b61ba1a08 |
hex | 338faff581 |
221454005633 has 16 divisors (see below), whose sum is σ = 254890745856. Its totient is φ = 188471162880.
The previous prime is 221454005629. The next prime is 221454005653. The reversal of 221454005633 is 336500454122.
It is not a de Polignac number, because 221454005633 - 22 = 221454005629 is a prime.
It is a super-2 number, since 2×2214540056332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221454005593 and 221454005602.
It is not an unprimeable number, because it can be changed into a prime (221454005623) 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 15 ways as a sum of consecutive naturals, for example, 546560 + ... + 861182.
It is an arithmetic number, because the mean of its divisors is an integer number (15930671616).
Almost surely, 2221454005633 is an apocalyptic number.
It is an amenable number.
221454005633 is a deficient number, since it is larger than the sum of its proper divisors (33436740223).
221454005633 is a wasteful number, since it uses less digits than its factorization.
221454005633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 315344.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 221454005633 its reverse (336500454122), we get a palindrome (557954459755).
The spelling of 221454005633 in words is "two hundred twenty-one billion, four hundred fifty-four million, five thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •