Base | Representation |
---|---|
bin | 1100111000001100101… |
… | …1101100011100100111 |
3 | 210011001220000112011021 |
4 | 3032003023230130213 |
5 | 12111102004304111 |
6 | 245345503152011 |
7 | 21661431532102 |
oct | 3160313543447 |
9 | 704056015137 |
10 | 221244213031 |
11 | 85913654956 |
12 | 36a662a5607 |
13 | 17b2b6cb62a |
14 | a9cb725739 |
15 | 5b4d560d71 |
hex | 33832ec727 |
221244213031 has 8 divisors (see below), whose sum is σ = 223342623504. Its totient is φ = 219152809920.
The previous prime is 221244213017. The next prime is 221244213083. The reversal of 221244213031 is 130312442122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221244213031 is a prime.
It is a super-2 number, since 2×2212442130312 (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 = 221244212987 and 221244213005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221244211031) 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, 1688385 + ... + 1814698.
It is an arithmetic number, because the mean of its divisors is an integer number (27917827938).
Almost surely, 2221244213031 is an apocalyptic number.
221244213031 is a deficient number, since it is larger than the sum of its proper divisors (2098410473).
221244213031 is a wasteful number, since it uses less digits than its factorization.
221244213031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3503681.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 221244213031 its reverse (130312442122), we get a palindrome (351556655153).
The spelling of 221244213031 in words is "two hundred twenty-one billion, two hundred forty-four million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •