Base | Representation |
---|---|
bin | 10000001001111110010… |
… | …101011100001011000101 |
3 | 10221010200012220001111122 |
4 | 100021332111130023011 |
5 | 121142213101041010 |
6 | 2210010055243325 |
7 | 143132212513625 |
oct | 20117625341305 |
9 | 3833605801448 |
10 | 1110221112005 |
11 | 3989299687a5 |
12 | 15b202979545 |
13 | 80902532345 |
14 | 3ba40b46885 |
15 | 1dd2ce88855 |
hex | 1027e55c2c5 |
1110221112005 has 8 divisors (see below), whose sum is σ = 1332271312152. Its totient is φ = 888172904448.
The previous prime is 1110221111977. The next prime is 1110221112017. The reversal of 1110221112005 is 5002111220111.
It can be written as a sum of positive squares in 4 ways, for example, as 303346491361 + 806874620644 = 550769^2 + 898262^2 .
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 1110221112005 - 212 = 1110221107909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1353029 + ... + 2012741.
It is an arithmetic number, because the mean of its divisors is an integer number (166533914019).
Almost surely, 21110221112005 is an apocalyptic number.
It is an amenable number.
1110221112005 is a deficient number, since it is larger than the sum of its proper divisors (222050200147).
1110221112005 is an equidigital number, since it uses as much as digits as its factorization.
1110221112005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996295.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 1110221112005 its reverse (5002111220111), we get a palindrome (6112332332116).
The spelling of 1110221112005 in words is "one trillion, one hundred ten billion, two hundred twenty-one million, one hundred twelve thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •