Base | Representation |
---|---|
bin | 11010001111011… |
… | …01001101101101 |
3 | 120100012110101020 |
4 | 31013231031231 |
5 | 422322432023 |
6 | 33502004353 |
7 | 5312010654 |
oct | 1507551555 |
9 | 510173336 |
10 | 220124013 |
11 | 10328847a |
12 | 618766b9 |
13 | 367b1cc5 |
14 | 2134019b |
15 | 144d1de3 |
hex | d1ed36d |
220124013 has 4 divisors (see below), whose sum is σ = 293498688. Its totient is φ = 146749340.
The previous prime is 220123951. The next prime is 220124033. The reversal of 220124013 is 310421022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220124013 - 212 = 220119917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220123983 and 220124001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220124033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36687333 + ... + 36687338.
It is an arithmetic number, because the mean of its divisors is an integer number (73374672).
Almost surely, 2220124013 is an apocalyptic number.
It is an amenable number.
220124013 is a deficient number, since it is larger than the sum of its proper divisors (73374675).
220124013 is an equidigital number, since it uses as much as digits as its factorization.
220124013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73374674.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 220124013 is about 14836.5768626055. The cubic root of 220124013 is about 603.7944831320.
Adding to 220124013 its reverse (310421022), we get a palindrome (530545035).
The spelling of 220124013 in words is "two hundred twenty million, one hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •