Base | Representation |
---|---|
bin | 1110001001101111001… |
… | …1110010001100110101 |
3 | 212020120022011002010112 |
4 | 3202123303302030311 |
5 | 12440413321241041 |
6 | 303405435032405 |
7 | 23365020463166 |
oct | 3423363621465 |
9 | 766508132115 |
10 | 243132212021 |
11 | 94125882516 |
12 | 3b15459b705 |
13 | 19c0929751a |
14 | baa666d76d |
15 | 64cee18deb |
hex | 389bcf2335 |
243132212021 has 4 divisors (see below), whose sum is σ = 243133783200. Its totient is φ = 243130640844.
The previous prime is 243132212017. The next prime is 243132212111. The reversal of 243132212021 is 120212231342.
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 a cyclic number.
It is not a de Polignac number, because 243132212021 - 22 = 243132212017 is a prime.
It is a super-2 number, since 2×2431322120212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243132212821) 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, 524561 + ... + 872598.
It is an arithmetic number, because the mean of its divisors is an integer number (60783445800).
Almost surely, 2243132212021 is an apocalyptic number.
It is an amenable number.
243132212021 is a deficient number, since it is larger than the sum of its proper divisors (1571179).
243132212021 is a wasteful number, since it uses less digits than its factorization.
243132212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1571178.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 243132212021 its reverse (120212231342), we get a palindrome (363344443363).
The spelling of 243132212021 in words is "two hundred forty-three billion, one hundred thirty-two million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •