Base | Representation |
---|---|
bin | 1110001010001011110… |
… | …1001101111000011101 |
3 | 212020212122210022002212 |
4 | 3202202331031320131 |
5 | 12441140021001323 |
6 | 303425401130205 |
7 | 23401004643266 |
oct | 3424275157035 |
9 | 766778708085 |
10 | 243252125213 |
11 | 94187535029 |
12 | 3b188789965 |
13 | 19c28090a86 |
14 | bab856596d |
15 | 64da703b78 |
hex | 38a2f4de1d |
243252125213 has 4 divisors (see below), whose sum is σ = 243331029408. Its totient is φ = 243173221020.
The previous prime is 243252125203. The next prime is 243252125239. The reversal of 243252125213 is 312521252342.
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 243252125213 - 218 = 243251863069 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 243252125213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243252125203) 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, 39447473 + ... + 39453638.
It is an arithmetic number, because the mean of its divisors is an integer number (60832757352).
Almost surely, 2243252125213 is an apocalyptic number.
It is an amenable number.
243252125213 is a deficient number, since it is larger than the sum of its proper divisors (78904195).
243252125213 is an equidigital number, since it uses as much as digits as its factorization.
243252125213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78904194.
The product of its digits is 28800, while the sum is 32.
Adding to 243252125213 its reverse (312521252342), we get a palindrome (555773377555).
The spelling of 243252125213 in words is "two hundred forty-three billion, two hundred fifty-two million, one hundred twenty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •