Base | Representation |
---|---|
bin | 1110001010001011100… |
… | …1000001000101110001 |
3 | 212020212120201100212010 |
4 | 3202202321001011301 |
5 | 12441134230233431 |
6 | 303425321353133 |
7 | 23400662406411 |
oct | 3424271010561 |
9 | 766776640763 |
10 | 243251024241 |
11 | 94186952935 |
12 | 3b1883387a9 |
13 | 19c27a96904 |
14 | bab835a641 |
15 | 64da587846 |
hex | 38a2e41171 |
243251024241 has 4 divisors (see below), whose sum is σ = 324334698992. Its totient is φ = 162167349492.
The previous prime is 243251024221. The next prime is 243251024273. The reversal of 243251024241 is 142420152342.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 243251024241 - 27 = 243251024113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 243251024199 and 243251024208.
It is not an unprimeable number, because it can be changed into a prime (243251024221) 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, 40541837371 + ... + 40541837376.
It is an arithmetic number, because the mean of its divisors is an integer number (81083674748).
Almost surely, 2243251024241 is an apocalyptic number.
It is an amenable number.
243251024241 is a deficient number, since it is larger than the sum of its proper divisors (81083674751).
243251024241 is an equidigital number, since it uses as much as digits as its factorization.
243251024241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81083674750.
The product of its (nonzero) digits is 15360, while the sum is 30.
Adding to 243251024241 its reverse (142420152342), we get a palindrome (385671176583).
The spelling of 243251024241 in words is "two hundred forty-three billion, two hundred fifty-one million, twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •