Base | Representation |
---|---|
bin | 110110110110101110101001… |
… | …000000110011010011010101 |
3 | 1011122012210110200002000000021 |
4 | 312312232221000303103111 |
5 | 223110212122021341003 |
6 | 2213035115401545141 |
7 | 101550062536412536 |
oct | 6666565100632325 |
9 | 1148183420060007 |
10 | 241255443543253 |
11 | 6a96494a400137 |
12 | 23084b07aa51b1 |
13 | a4803a18b8769 |
14 | 4380b7bcb668d |
15 | 1cd591b1a82bd |
hex | db6ba90334d5 |
241255443543253 has 2 divisors, whose sum is σ = 241255443543254. Its totient is φ = 241255443543252.
The previous prime is 241255443543167. The next prime is 241255443543269. The reversal of 241255443543253 is 352345344552142.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 213129837467089 + 28125606076164 = 14598967^2 + 5303358^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-241255443543253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 241255443543253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241255443544253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120627721771626 + 120627721771627.
It is an arithmetic number, because the mean of its divisors is an integer number (120627721771627).
Almost surely, 2241255443543253 is an apocalyptic number.
It is an amenable number.
241255443543253 is a deficient number, since it is larger than the sum of its proper divisors (1).
241255443543253 is an equidigital number, since it uses as much as digits as its factorization.
241255443543253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560000, while the sum is 52.
The spelling of 241255443543253 in words is "two hundred forty-one trillion, two hundred fifty-five billion, four hundred forty-three million, five hundred forty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •