Base | Representation |
---|---|
bin | 1100111000011100101… |
… | …0111000101110001111 |
3 | 210011020112220020120221 |
4 | 3032013022320232033 |
5 | 12111221121010111 |
6 | 245400253052211 |
7 | 21663203253064 |
oct | 3160712705617 |
9 | 704215806527 |
10 | 221311110031 |
11 | 85948396630 |
12 | 36a84787067 |
13 | 17b3c52195b |
14 | a9d657ac6b |
15 | 5b54377371 |
hex | 33872b8b8f |
221311110031 has 8 divisors (see below), whose sum is σ = 241442456400. Its totient is φ = 201181789440.
The previous prime is 221311110029. The next prime is 221311110037. The reversal of 221311110031 is 130011113122.
It is a happy number.
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 221311110031 - 21 = 221311110029 is a prime.
It is a super-2 number, since 2×2213111100312 (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 = 221311109987 and 221311110014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221311110037) 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, 273346 + ... + 719263.
It is an arithmetic number, because the mean of its divisors is an integer number (30180307050).
Almost surely, 2221311110031 is an apocalyptic number.
221311110031 is a deficient number, since it is larger than the sum of its proper divisors (20131346369).
221311110031 is a wasteful number, since it uses less digits than its factorization.
221311110031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1012889.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 221311110031 its reverse (130011113122), we get a palindrome (351322223153).
The spelling of 221311110031 in words is "two hundred twenty-one billion, three hundred eleven million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •