Base | Representation |
---|---|
bin | 110111000111011011110111… |
… | …111001101010011101001011 |
3 | 1011210021112212022202111211211 |
4 | 313013123313321222131023 |
5 | 223233014403433340412 |
6 | 2215314350304233551 |
7 | 102026035165600123 |
oct | 6707336771523513 |
9 | 1153245768674754 |
10 | 242403523340107 |
11 | 7026783652a128 |
12 | 2322b51560b8b7 |
13 | a53472867816c |
14 | 43c0570a67c83 |
15 | 1d05712b4eca7 |
hex | dc76f7e6a74b |
242403523340107 has 2 divisors, whose sum is σ = 242403523340108. Its totient is φ = 242403523340106.
The previous prime is 242403523340093. The next prime is 242403523340171. The reversal of 242403523340107 is 701043325304242.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 242403523340107 - 235 = 242369163601739 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 242403523340107.
It is not a weakly prime, because it can be changed into another prime (242403523340197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121201761670053 + 121201761670054.
It is an arithmetic number, because the mean of its divisors is an integer number (121201761670054).
Almost surely, 2242403523340107 is an apocalyptic number.
242403523340107 is a deficient number, since it is larger than the sum of its proper divisors (1).
242403523340107 is an equidigital number, since it uses as much as digits as its factorization.
242403523340107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 483840, while the sum is 40.
Adding to 242403523340107 its reverse (701043325304242), we get a palindrome (943446848644349).
The spelling of 242403523340107 in words is "two hundred forty-two trillion, four hundred three billion, five hundred twenty-three million, three hundred forty thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •