Base | Representation |
---|---|
bin | 1110001001010011100… |
… | …0110111110011111101 |
3 | 212020021012200020112101 |
4 | 3202110320313303331 |
5 | 12440144110331323 |
6 | 303350130305101 |
7 | 23362110545320 |
oct | 3422470676375 |
9 | 766235606471 |
10 | 243016105213 |
11 | 9407628a782 |
12 | 3b121728191 |
13 | 19bbb20467b |
14 | ba950887b7 |
15 | 64c4b31dad |
hex | 3894e37cfd |
243016105213 has 32 divisors (see below), whose sum is σ = 304287436800. Its totient is φ = 189362287296.
The previous prime is 243016105207. The next prime is 243016105219. The reversal of 243016105213 is 312501610342.
It is an interprime number because it is at equal distance from previous prime (243016105207) and next prime (243016105219).
It is not a de Polignac number, because 243016105213 - 25 = 243016105181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243016105219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 435420 + ... + 821962.
It is an arithmetic number, because the mean of its divisors is an integer number (9508982400).
Almost surely, 2243016105213 is an apocalyptic number.
It is an amenable number.
243016105213 is a deficient number, since it is larger than the sum of its proper divisors (61271331587).
243016105213 is a wasteful number, since it uses less digits than its factorization.
243016105213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386761.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 243016105213 its reverse (312501610342), we get a palindrome (555517715555).
The spelling of 243016105213 in words is "two hundred forty-three billion, sixteen million, one hundred five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •