Base | Representation |
---|---|
bin | 100011001111001111001… |
… | …110101001010000000111 |
3 | 22120111102111221202222222 |
4 | 203033033032221100013 |
5 | 304133310041412333 |
6 | 5052235221042555 |
7 | 336644046344033 |
oct | 43171716512007 |
9 | 8514374852888 |
10 | 2421543310343 |
11 | 853a750840a3 |
12 | 331389b5645b |
13 | 147473224b11 |
14 | 852bbcb31c3 |
15 | 42ecad94298 |
hex | 233cf3a9407 |
2421543310343 has 4 divisors (see below), whose sum is σ = 2422367247720. Its totient is φ = 2420719372968.
The previous prime is 2421543310259. The next prime is 2421543310367. The reversal of 2421543310343 is 3430133451242.
2421543310343 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 2421543310343 - 226 = 2421476201479 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 (2421543310243) 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, 411964280 + ... + 411970157.
It is an arithmetic number, because the mean of its divisors is an integer number (605591811930).
Almost surely, 22421543310343 is an apocalyptic number.
2421543310343 is a deficient number, since it is larger than the sum of its proper divisors (823937377).
2421543310343 is an equidigital number, since it uses as much as digits as its factorization.
2421543310343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823937376.
The product of its (nonzero) digits is 103680, while the sum is 35.
Adding to 2421543310343 its reverse (3430133451242), we get a palindrome (5851676761585).
The spelling of 2421543310343 in words is "two trillion, four hundred twenty-one billion, five hundred forty-three million, three hundred ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •