Base | Representation |
---|---|
bin | 1110001010011001101… |
… | …0110111101111110001 |
3 | 212021000201010100121000 |
4 | 3202212122313233301 |
5 | 12441244404334023 |
6 | 303435234352213 |
7 | 23402311556430 |
oct | 3424632675761 |
9 | 767021110530 |
10 | 243310230513 |
11 | 94207311439 |
12 | 3b1a412b669 |
13 | 19c371264cc |
14 | bac216d117 |
15 | 64e0880243 |
hex | 38a66b7bf1 |
243310230513 has 32 divisors (see below), whose sum is σ = 412341708800. Its totient is φ = 138903508368.
The previous prime is 243310230509. The next prime is 243310230529. The reversal of 243310230513 is 315032013342.
243310230513 is a `hidden beast` number, since 2 + 43 + 3 + 102 + 3 + 0 + 513 = 666.
It is not a de Polignac number, because 243310230513 - 22 = 243310230509 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (243310230013) 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, 404623 + ... + 806436.
It is an arithmetic number, because the mean of its divisors is an integer number (12885678400).
Almost surely, 2243310230513 is an apocalyptic number.
It is an amenable number.
243310230513 is a deficient number, since it is larger than the sum of its proper divisors (169031478287).
243310230513 is a wasteful number, since it uses less digits than its factorization.
243310230513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1212138 (or 1212132 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 243310230513 its reverse (315032013342), we get a palindrome (558342243855).
The spelling of 243310230513 in words is "two hundred forty-three billion, three hundred ten million, two hundred thirty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •