Base | Representation |
---|---|
bin | 110110110110101100101011… |
… | …111011101101001100101111 |
3 | 1011122012121001102101210000221 |
4 | 312312230223323231030233 |
5 | 223110143322313234120 |
6 | 2213034131240032211 |
7 | 101546656535514541 |
oct | 6666545373551457 |
9 | 1148177042353027 |
10 | 241253345055535 |
11 | 6a963a7290526a |
12 | 23084621162667 |
13 | a480128c0a057 |
14 | 4380a1d301691 |
15 | 1cd5846d3e0aa |
hex | db6b2beed32f |
241253345055535 has 4 divisors (see below), whose sum is σ = 289504014066648. Its totient is φ = 193002676044424.
The previous prime is 241253345055493. The next prime is 241253345055539. The reversal of 241253345055535 is 535550543352142.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241253345055535 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 (241253345055539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24125334505549 + ... + 24125334505558.
It is an arithmetic number, because the mean of its divisors is an integer number (72376003516662).
Almost surely, 2241253345055535 is an apocalyptic number.
241253345055535 is a deficient number, since it is larger than the sum of its proper divisors (48250669011113).
241253345055535 is an equidigital number, since it uses as much as digits as its factorization.
241253345055535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48250669011112.
The product of its (nonzero) digits is 27000000, while the sum is 52.
The spelling of 241253345055535 in words is "two hundred forty-one trillion, two hundred fifty-three billion, three hundred forty-five million, fifty-five thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •