Base | Representation |
---|---|
bin | 1110001011001011111… |
… | …1101111110101011111 |
3 | 212021120102010221021202 |
4 | 3202302333233311133 |
5 | 12442212413132111 |
6 | 303512212550115 |
7 | 23410453152041 |
oct | 3426277576537 |
9 | 767512127252 |
10 | 243521224031 |
11 | 94305422a48 |
12 | 3b24292233b |
13 | 19c6ba5c647 |
14 | bb021b3a91 |
15 | 650415bb3b |
hex | 38b2fefd5f |
243521224031 has 4 divisors (see below), whose sum is σ = 245438714112. Its totient is φ = 241603733952.
The previous prime is 243521224003. The next prime is 243521224049. The reversal of 243521224031 is 130422125342.
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 243521224031 - 210 = 243521223007 is a prime.
It is a super-2 number, since 2×2435212240312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 243521223985 and 243521224003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243521284031) 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, 958744850 + ... + 958745103.
It is an arithmetic number, because the mean of its divisors is an integer number (61359678528).
Almost surely, 2243521224031 is an apocalyptic number.
243521224031 is a deficient number, since it is larger than the sum of its proper divisors (1917490081).
243521224031 is a wasteful number, since it uses less digits than its factorization.
243521224031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1917490080.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 243521224031 its reverse (130422125342), we get a palindrome (373943349373).
The spelling of 243521224031 in words is "two hundred forty-three billion, five hundred twenty-one million, two hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •