Base | Representation |
---|---|
bin | 11010110001001… |
… | …01110011101001 |
3 | 120122112022212011 |
4 | 31120211303221 |
5 | 424441100441 |
6 | 34140515521 |
7 | 5364434035 |
oct | 1530456351 |
9 | 518468764 |
10 | 224550121 |
11 | 105830914 |
12 | 6324bba1 |
13 | 376a17c3 |
14 | 21b731c5 |
15 | 14aa8581 |
hex | d625ce9 |
224550121 has 4 divisors (see below), whose sum is σ = 224672644. Its totient is φ = 224427600.
The previous prime is 224550119. The next prime is 224550163. The reversal of 224550121 is 121055422.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 12702096 + 211848025 = 3564^2 + 14555^2 .
It is a cyclic number.
It is not a de Polignac number, because 224550121 - 21 = 224550119 is a prime.
It is a super-2 number, since 2×2245501212 = 100845513682229282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 224550092 and 224550101.
It is not an unprimeable number, because it can be changed into a prime (224550181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58470 + ... + 62191.
It is an arithmetic number, because the mean of its divisors is an integer number (56168161).
Almost surely, 2224550121 is an apocalyptic number.
It is an amenable number.
224550121 is a deficient number, since it is larger than the sum of its proper divisors (122523).
224550121 is a wasteful number, since it uses less digits than its factorization.
224550121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122522.
The product of its (nonzero) digits is 800, while the sum is 22.
The square root of 224550121 is about 14984.9965298628. The cubic root of 224550121 is about 607.8145579782.
The spelling of 224550121 in words is "two hundred twenty-four million, five hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •