Base | Representation |
---|---|
bin | 1110000111011001110… |
… | …0000011100001001111 |
3 | 212011221121101022200021 |
4 | 3201312130003201033 |
5 | 12433122320001021 |
6 | 303223320443011 |
7 | 23343335324341 |
oct | 3416634034117 |
9 | 764847338607 |
10 | 242505234511 |
11 | 93933978a91 |
12 | 3abba619467 |
13 | 19b39414607 |
14 | ba472a3291 |
15 | 6494d6cc41 |
hex | 387670384f |
242505234511 has 2 divisors, whose sum is σ = 242505234512. Its totient is φ = 242505234510.
The previous prime is 242505234509. The next prime is 242505234541. The reversal of 242505234511 is 115432505242.
It is a happy number.
242505234511 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 242505234511 - 21 = 242505234509 is a prime.
Together with 242505234509, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (242505234541) 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 as a sum of consecutive naturals, namely, 121252617255 + 121252617256.
It is an arithmetic number, because the mean of its divisors is an integer number (121252617256).
Almost surely, 2242505234511 is an apocalyptic number.
242505234511 is a deficient number, since it is larger than the sum of its proper divisors (1).
242505234511 is an equidigital number, since it uses as much as digits as its factorization.
242505234511 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 34.
Adding to 242505234511 its reverse (115432505242), we get a palindrome (357937739753).
The spelling of 242505234511 in words is "two hundred forty-two billion, five hundred five million, two hundred thirty-four thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •