Base | Representation |
---|---|
bin | 1100110111101100110… |
… | …0001010111001001101 |
3 | 210010201112200220010012 |
4 | 3031323030022321031 |
5 | 12110313142320023 |
6 | 245324313123005 |
7 | 21655213003256 |
oct | 3157314127115 |
9 | 703645626105 |
10 | 221110120013 |
11 | 85854997882 |
12 | 36a293b9465 |
13 | 17b099abb53 |
14 | a9b79bbb2d |
15 | 5b418c4978 |
hex | 337b30ae4d |
221110120013 has 16 divisors (see below), whose sum is σ = 231542766000. Its totient is φ = 210880535040.
The previous prime is 221110120001. The next prime is 221110120039. The reversal of 221110120013 is 310021011122.
It can be written as a sum of positive squares in 8 ways, for example, as 42352816804 + 178757303209 = 205798^2 + 422797^2 .
It is a cyclic number.
It is not a de Polignac number, because 221110120013 - 218 = 221109857869 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 221110120013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221110120043) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 640745 + ... + 923457.
It is an arithmetic number, because the mean of its divisors is an integer number (14471422875).
Almost surely, 2221110120013 is an apocalyptic number.
It is an amenable number.
221110120013 is a deficient number, since it is larger than the sum of its proper divisors (10432645987).
221110120013 is a wasteful number, since it uses less digits than its factorization.
221110120013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283072.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 221110120013 its reverse (310021011122), we get a palindrome (531131131135).
The spelling of 221110120013 in words is "two hundred twenty-one billion, one hundred ten million, one hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •