Base | Representation |
---|---|
bin | 110110111001101110100100… |
… | …001001000001010111011111 |
3 | 1011122221111101111201222021112 |
4 | 312321232210021001113133 |
5 | 223122101143140222033 |
6 | 2213313520244452235 |
7 | 101601006365432045 |
oct | 6671564411012737 |
9 | 1148844344658245 |
10 | 241461520242143 |
11 | 6aa3428a319133 |
12 | 230b8a3a6aa07b |
13 | a496953b49346 |
14 | 438ab2b050395 |
15 | 1cdae7cd65c48 |
hex | db9ba42415df |
241461520242143 has 4 divisors (see below), whose sum is σ = 241461986274600. Its totient is φ = 241461054209688.
The previous prime is 241461520242091. The next prime is 241461520242157. The reversal of 241461520242143 is 341242025164142.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 241461520242143 - 214 = 241461520225759 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 241461520242143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (241461520242193) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 232238180 + ... + 233275577.
It is an arithmetic number, because the mean of its divisors is an integer number (60365496568650).
Almost surely, 2241461520242143 is an apocalyptic number.
241461520242143 is a deficient number, since it is larger than the sum of its proper divisors (466032457).
241461520242143 is an equidigital number, since it uses as much as digits as its factorization.
241461520242143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466032456.
The product of its (nonzero) digits is 368640, while the sum is 41.
The spelling of 241461520242143 in words is "two hundred forty-one trillion, four hundred sixty-one billion, five hundred twenty million, two hundred forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.188 sec. • engine limits •