Base | Representation |
---|---|
bin | 1110001001101100100… |
… | …1001011001110001011 |
3 | 212020112112010121011201 |
4 | 3202123021023032023 |
5 | 12440402441323230 |
6 | 303404355405031 |
7 | 23364523522354 |
oct | 3423311131613 |
9 | 766475117151 |
10 | 243121042315 |
11 | 9411a543558 |
12 | 3b1508b3777 |
13 | 19c06b86428 |
14 | baa4da2d2b |
15 | 64cde5e5ca |
hex | 389b24b38b |
243121042315 has 8 divisors (see below), whose sum is σ = 291901192128. Its totient is φ = 194392872960.
The previous prime is 243121042313. The next prime is 243121042321. The reversal of 243121042315 is 513240121342.
243121042315 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 243121042315 - 21 = 243121042313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (243121042313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12984822 + ... + 13003531.
It is an arithmetic number, because the mean of its divisors is an integer number (36487649016).
Almost surely, 2243121042315 is an apocalyptic number.
243121042315 is a deficient number, since it is larger than the sum of its proper divisors (48780149813).
243121042315 is a wasteful number, since it uses less digits than its factorization.
243121042315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25990229.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 243121042315 its reverse (513240121342), we get a palindrome (756361163657).
The spelling of 243121042315 in words is "two hundred forty-three billion, one hundred twenty-one million, forty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •