Base | Representation |
---|---|
bin | 110110110011001100010011… |
… | …000110100110110110011111 |
3 | 1011121100120011021011202220111 |
4 | 312303030103012212312133 |
5 | 223042221404020023033 |
6 | 2212331323420230451 |
7 | 101523400130144266 |
oct | 6663142306466637 |
9 | 1147316137152814 |
10 | 241012410314143 |
11 | 6a880875494a86 |
12 | 230459a069b427 |
13 | a4634acc99b10 |
14 | 43730c48515dd |
15 | 1cce444ce27cd |
hex | db33131a6d9f |
241012410314143 has 16 divisors (see below), whose sum is σ = 270878223704256. Its totient is φ = 212767620468480.
The previous prime is 241012410314113. The next prime is 241012410314177. The reversal of 241012410314143 is 341413014210142.
It is a cyclic number.
It is not a de Polignac number, because 241012410314143 - 245 = 205828038225311 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 (241012410314113) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59855280 + ... + 63754837.
It is an arithmetic number, because the mean of its divisors is an integer number (16929888981516).
Almost surely, 2241012410314143 is an apocalyptic number.
241012410314143 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
241012410314143 is a deficient number, since it is larger than the sum of its proper divisors (29865813390113).
241012410314143 is a wasteful number, since it uses less digits than its factorization.
241012410314143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123616674.
The product of its (nonzero) digits is 9216, while the sum is 31.
Adding to 241012410314143 its reverse (341413014210142), we get a palindrome (582425424524285).
The spelling of 241012410314143 in words is "two hundred forty-one trillion, twelve billion, four hundred ten million, three hundred fourteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •