Base | Representation |
---|---|
bin | 11100110001000… |
… | …01110100100101 |
3 | 121211001212110221 |
4 | 32120201310211 |
5 | 443233423023 |
6 | 35540044341 |
7 | 5660052436 |
oct | 1630416445 |
9 | 554055427 |
10 | 241311013 |
11 | 114239599 |
12 | 689936b1 |
13 | 3acbc7a8 |
14 | 2409748d |
15 | 162b985d |
hex | e621d25 |
241311013 has 8 divisors (see below), whose sum is σ = 244193400. Its totient is φ = 238445760.
The previous prime is 241310989. The next prime is 241311017. The reversal of 241311013 is 310113142.
It can be written as a sum of positive squares in 4 ways, for example, as 116251524 + 125059489 = 10782^2 + 11183^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241311013 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 (241311017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25243 + ... + 33463.
It is an arithmetic number, because the mean of its divisors is an integer number (30524175).
Almost surely, 2241311013 is an apocalyptic number.
It is an amenable number.
241311013 is a deficient number, since it is larger than the sum of its proper divisors (2882387).
241311013 is a wasteful number, since it uses less digits than its factorization.
241311013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8567.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 241311013 is about 15534.1885208079. The cubic root of 241311013 is about 622.5760087400.
Adding to 241311013 its reverse (310113142), we get a palindrome (551424155).
The spelling of 241311013 in words is "two hundred forty-one million, three hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •