Base | Representation |
---|---|
bin | 11010101101011… |
… | …10001111111101 |
3 | 120121121110002211 |
4 | 31112232033331 |
5 | 424324413123 |
6 | 34122220421 |
7 | 5360324233 |
oct | 1526561775 |
9 | 517543084 |
10 | 224060413 |
11 | 1055269a5 |
12 | 63054711 |
13 | 3755c935 |
14 | 21a86953 |
15 | 14a0d40d |
hex | d5ae3fd |
224060413 has 4 divisors (see below), whose sum is σ = 224100640. Its totient is φ = 224020188.
The previous prime is 224060399. The next prime is 224060477. The reversal of 224060413 is 314060422.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-224060413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (224060113) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 10095 + ... + 23452.
It is an arithmetic number, because the mean of its divisors is an integer number (56025160).
Almost surely, 2224060413 is an apocalyptic number.
It is an amenable number.
224060413 is a deficient number, since it is larger than the sum of its proper divisors (40227).
224060413 is an equidigital number, since it uses as much as digits as its factorization.
224060413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40226.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 224060413 is about 14968.6476677087. The cubic root of 224060413 is about 607.3723875180.
Subtracting 224060413 from its reverse (314060422), we obtain a palindrome (90000009).
The spelling of 224060413 in words is "two hundred twenty-four million, sixty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •