Base | Representation |
---|---|
bin | 11100101111101… |
… | …00001100011001 |
3 | 121210201101010000 |
4 | 32113310030121 |
5 | 443211432441 |
6 | 35532043213 |
7 | 5655343530 |
oct | 1627641431 |
9 | 553641100 |
10 | 241124121 |
11 | 114121137 |
12 | 68903509 |
13 | 3ac556c4 |
14 | 24049317 |
15 | 1627e2b6 |
hex | e5f4319 |
241124121 has 40 divisors (see below), whose sum is σ = 413916800. Its totient is φ = 137028672.
The previous prime is 241124099. The next prime is 241124171. The reversal of 241124121 is 121421142.
241124121 is a `hidden beast` number, since 241 + 12 + 412 + 1 = 666.
It is not a de Polignac number, because 241124121 - 210 = 241123097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 241124094 and 241124103.
It is not an unprimeable number, because it can be changed into a prime (241124171) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 111765 + ... + 113901.
It is an arithmetic number, because the mean of its divisors is an integer number (10347920).
Almost surely, 2241124121 is an apocalyptic number.
241124121 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
241124121 is a deficient number, since it is larger than the sum of its proper divisors (172792679).
241124121 is a wasteful number, since it uses less digits than its factorization.
241124121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2355 (or 2346 counting only the distinct ones).
The product of its digits is 128, while the sum is 18.
The square root of 241124121 is about 15528.1718498991. The cubic root of 241124121 is about 622.4152417624.
Adding to 241124121 its reverse (121421142), we get a palindrome (362545263).
The spelling of 241124121 in words is "two hundred forty-one million, one hundred twenty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •