Base | Representation |
---|---|
bin | 110010010101111101101001… |
… | …110100110010001000101101 |
3 | 1002000221202010111111020121011 |
4 | 302111331221310302020231 |
5 | 213010102011414124441 |
6 | 2102523033430305221 |
7 | 64431314464645606 |
oct | 6225755164621055 |
9 | 1060852114436534 |
10 | 221411634520621 |
11 | 64604168552176 |
12 | 209bb0844b8211 |
13 | 96710486984bc |
14 | 3c9654772cdad |
15 | 1a8e6586b0581 |
hex | c95f69d3222d |
221411634520621 has 8 divisors (see below), whose sum is σ = 224034041687040. Its totient is φ = 218792219265312.
The previous prime is 221411634520613. The next prime is 221411634520631. The reversal of 221411634520621 is 126025436114122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 221411634520621 - 23 = 221411634520613 is a prime.
It is a super-2 number, since 2×2214116345206212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221411634520631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 747828895 + ... + 748124908.
It is an arithmetic number, because the mean of its divisors is an integer number (28004255210880).
Almost surely, 2221411634520621 is an apocalyptic number.
It is an amenable number.
221411634520621 is a deficient number, since it is larger than the sum of its proper divisors (2622407166419).
221411634520621 is a wasteful number, since it uses less digits than its factorization.
221411634520621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1495955555.
The product of its (nonzero) digits is 138240, while the sum is 40.
The spelling of 221411634520621 in words is "two hundred twenty-one trillion, four hundred eleven billion, six hundred thirty-four million, five hundred twenty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •