Base | Representation |
---|---|
bin | 1100110111101101011… |
… | …1100111010100011111 |
3 | 210010201202100022100222 |
4 | 3031323113213110133 |
5 | 12110314424320111 |
6 | 245324501311555 |
7 | 21655250336546 |
oct | 3157327472437 |
9 | 703652308328 |
10 | 221113120031 |
11 | 85856656831 |
12 | 36a2a4055bb |
13 | 17b0a4bc4cb |
14 | a9b815d15d |
15 | 5b41cb87db |
hex | 337b5e751f |
221113120031 has 8 divisors (see below), whose sum is σ = 223606545840. Its totient is φ = 218619894592.
The previous prime is 221113120013. The next prime is 221113120037. The reversal of 221113120031 is 130021311122.
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 221113120031 - 226 = 221046011167 is a prime.
It is a super-2 number, since 2×2211131200312 (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 = 221113119991 and 221113120009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221113120037) 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, 4025156 + ... + 4079718.
It is an arithmetic number, because the mean of its divisors is an integer number (27950818230).
Almost surely, 2221113120031 is an apocalyptic number.
221113120031 is a deficient number, since it is larger than the sum of its proper divisors (2493425809).
221113120031 is an equidigital number, since it uses as much as digits as its factorization.
221113120031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100185.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 221113120031 its reverse (130021311122), we get a palindrome (351134431153).
The spelling of 221113120031 in words is "two hundred twenty-one billion, one hundred thirteen million, one hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •