Base | Representation |
---|---|
bin | 1110001010110011111… |
… | …1010010101101001111 |
3 | 212021022101111122112120 |
4 | 3202230333102231033 |
5 | 12442011113111143 |
6 | 303454212504023 |
7 | 23405120420145 |
oct | 3425477225517 |
9 | 767271448476 |
10 | 243420441423 |
11 | 94263547535 |
12 | 3b21501b013 |
13 | 19c53c03873 |
14 | bad2a5b595 |
15 | 64ea3a0383 |
hex | 38acfd2b4f |
243420441423 has 4 divisors (see below), whose sum is σ = 324560588568. Its totient is φ = 162280294280.
The previous prime is 243420441361. The next prime is 243420441427. The reversal of 243420441423 is 324144024342.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 243420441423 - 225 = 243386886991 is a prime.
It is a super-2 number, since 2×2434204414232 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (243420441427) 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 3 ways as a sum of consecutive naturals, for example, 40570073568 + ... + 40570073573.
It is an arithmetic number, because the mean of its divisors is an integer number (81140147142).
Almost surely, 2243420441423 is an apocalyptic number.
243420441423 is a deficient number, since it is larger than the sum of its proper divisors (81140147145).
243420441423 is an equidigital number, since it uses as much as digits as its factorization.
243420441423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81140147144.
The product of its (nonzero) digits is 73728, while the sum is 33.
Adding to 243420441423 its reverse (324144024342), we get a palindrome (567564465765).
The spelling of 243420441423 in words is "two hundred forty-three billion, four hundred twenty million, four hundred forty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •