Base | Representation |
---|---|
bin | 1110000011011011110… |
… | …0111010001000111101 |
3 | 212002012101011010200220 |
4 | 3200312330322020331 |
5 | 12423432131330041 |
6 | 302525511211553 |
7 | 23305053013503 |
oct | 3406674721075 |
9 | 762171133626 |
10 | 241440105021 |
11 | 93437710485 |
12 | 3a961976bb9 |
13 | 199c985278b |
14 | b985a40673 |
15 | 64315c3d66 |
hex | 3836f3a23d |
241440105021 has 8 divisors (see below), whose sum is σ = 324269922624. Its totient is φ = 159785178720.
The previous prime is 241440105013. The next prime is 241440105029. The reversal of 241440105021 is 120501044142.
It is an interprime number because it is at equal distance from previous prime (241440105013) and next prime (241440105029).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 241440105021 - 23 = 241440105013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 241440104982 and 241440105000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241440105029) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 293722345 + ... + 293723166.
It is an arithmetic number, because the mean of its divisors is an integer number (40533740328).
Almost surely, 2241440105021 is an apocalyptic number.
It is an amenable number.
241440105021 is a deficient number, since it is larger than the sum of its proper divisors (82829817603).
241440105021 is a wasteful number, since it uses less digits than its factorization.
241440105021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587445651.
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 241440105021 its reverse (120501044142), we get a palindrome (361941149163).
The spelling of 241440105021 in words is "two hundred forty-one billion, four hundred forty million, one hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •