Base | Representation |
---|---|
bin | 110110111011000100001010… |
… | …101010001001011101011101 |
3 | 1011200021021122011122211111102 |
4 | 312323010022222021131131 |
5 | 223130102413213442133 |
6 | 2213424041010402445 |
7 | 101610442201032635 |
oct | 6673041252113535 |
9 | 1150237564584442 |
10 | 241553434515293 |
11 | 6aa6a266553a4a |
12 | 23112810590425 |
13 | a4a251142ba14 |
14 | 439136a28d6c5 |
15 | 1cdd55c2be7e8 |
hex | dbb10aa8975d |
241553434515293 has 2 divisors, whose sum is σ = 241553434515294. Its totient is φ = 241553434515292.
The previous prime is 241553434515269. The next prime is 241553434515439. The reversal of 241553434515293 is 392515434355142.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177128363045764 + 64425071469529 = 13308958^2 + 8026523^2 .
It is a cyclic number.
It is not a de Polignac number, because 241553434515293 - 28 = 241553434515037 is a prime.
It is a super-2 number, since 2×2415534345152932 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241553434515493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120776717257646 + 120776717257647.
It is an arithmetic number, because the mean of its divisors is an integer number (120776717257647).
Almost surely, 2241553434515293 is an apocalyptic number.
It is an amenable number.
241553434515293 is a deficient number, since it is larger than the sum of its proper divisors (1).
241553434515293 is an equidigital number, since it uses as much as digits as its factorization.
241553434515293 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 38880000, while the sum is 56.
The spelling of 241553434515293 in words is "two hundred forty-one trillion, five hundred fifty-three billion, four hundred thirty-four million, five hundred fifteen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •