Base | Representation |
---|---|
bin | 100001001011010… |
… | …0110010000010001 |
3 | 2212120201102220120 |
4 | 1002112212100101 |
5 | 4234441020423 |
6 | 302244100453 |
7 | 36405133455 |
oct | 10226462021 |
9 | 2776642816 |
10 | 1113220113 |
11 | 521424825 |
12 | 270994729 |
13 | 14982c135 |
14 | a7bc0665 |
15 | 67ae7ee3 |
hex | 425a6411 |
1113220113 has 8 divisors (see below), whose sum is σ = 1486604448. Its totient is φ = 740991264.
The previous prime is 1113220103. The next prime is 1113220117. The reversal of 1113220113 is 3110223111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1113220113 - 210 = 1113219089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113220092 and 1113220101.
It is not an unprimeable number, because it can be changed into a prime (1113220117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286620 + ... + 290477.
It is an arithmetic number, because the mean of its divisors is an integer number (185825556).
Almost surely, 21113220113 is an apocalyptic number.
It is an amenable number.
1113220113 is a deficient number, since it is larger than the sum of its proper divisors (373384335).
1113220113 is an equidigital number, since it uses as much as digits as its factorization.
1113220113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577743.
The product of its (nonzero) digits is 36, while the sum is 15.
The square root of 1113220113 is about 33364.9533642713. The cubic root of 1113220113 is about 1036.3990703916.
Adding to 1113220113 its reverse (3110223111), we get a palindrome (4223443224).
The spelling of 1113220113 in words is "one billion, one hundred thirteen million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •