Base | Representation |
---|---|
bin | 1100110111011001111… |
… | …0110010000101000111 |
3 | 210010112001000220220200 |
4 | 3031312132302011013 |
5 | 12110132431104111 |
6 | 245312411501543 |
7 | 21653233314231 |
oct | 3156636620507 |
9 | 703461026820 |
10 | 221031113031 |
11 | 85814334753 |
12 | 36a06a578b3 |
13 | 17ac6508761 |
14 | a9ab2d3251 |
15 | 5b399ba256 |
hex | 33767b2147 |
221031113031 has 12 divisors (see below), whose sum is σ = 319994429040. Its totient is φ = 147018414240.
The previous prime is 221031112979. The next prime is 221031113141. The reversal of 221031113031 is 130311130122.
221031113031 is a `hidden beast` number, since 221 + 0 + 311 + 130 + 3 + 1 = 666.
It is not a de Polignac number, because 221031113031 - 217 = 221030981959 is a prime.
It is a super-2 number, since 2×2210311130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 221031112995 and 221031113013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221031113431) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27967590 + ... + 27975491.
It is an arithmetic number, because the mean of its divisors is an integer number (26666202420).
Almost surely, 2221031113031 is an apocalyptic number.
221031113031 is a deficient number, since it is larger than the sum of its proper divisors (98963316009).
221031113031 is a wasteful number, since it uses less digits than its factorization.
221031113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55943526 (or 55943523 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 221031113031 its reverse (130311130122), we get a palindrome (351342243153).
The spelling of 221031113031 in words is "two hundred twenty-one billion, thirty-one million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •