Base | Representation |
---|---|
bin | 110111010001111000011110… |
… | …100011000101111010001111 |
3 | 1011212211011220120012011102101 |
4 | 313101320132203011322033 |
5 | 223331300142401214403 |
6 | 2221024235454535531 |
7 | 102131641465413625 |
oct | 6721703643057217 |
9 | 1155734816164371 |
10 | 243121431273103 |
11 | 70514246877949 |
12 | 2332668b5075a7 |
13 | a587338c4b956 |
14 | 44071d6471515 |
15 | 1d1922de7671d |
hex | dd1e1e8c5e8f |
243121431273103 has 8 divisors (see below), whose sum is σ = 251505810143280. Its totient is φ = 234737111152320.
The previous prime is 243121431273089. The next prime is 243121431273137. The reversal of 243121431273103 is 301372134121342.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 243121431273103 - 29 = 243121431272591 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 (243121431273803) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6184638 + ... + 22901803.
It is an arithmetic number, because the mean of its divisors is an integer number (31438226267910).
Almost surely, 2243121431273103 is an apocalyptic number.
243121431273103 is a deficient number, since it is larger than the sum of its proper divisors (8384378870177).
243121431273103 is a wasteful number, since it uses less digits than its factorization.
243121431273103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29374697.
The product of its (nonzero) digits is 72576, while the sum is 37.
Adding to 243121431273103 its reverse (301372134121342), we get a palindrome (544493565394445).
The spelling of 243121431273103 in words is "two hundred forty-three trillion, one hundred twenty-one billion, four hundred thirty-one million, two hundred seventy-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •