Base | Representation |
---|---|
bin | 1110000111001000100… |
… | …0111100010100101001 |
3 | 212011202120200021220022 |
4 | 3201302020330110221 |
5 | 12433000334143213 |
6 | 303212223010225 |
7 | 23341501323545 |
oct | 3416210742451 |
9 | 764676607808 |
10 | 242433115433 |
11 | 938a719a943 |
12 | 3ab9a439975 |
13 | 19b274b33c2 |
14 | ba3b88ca25 |
15 | 648d874308 |
hex | 387223c529 |
242433115433 has 2 divisors, whose sum is σ = 242433115434. Its totient is φ = 242433115432.
The previous prime is 242433115373. The next prime is 242433115537. The reversal of 242433115433 is 334511334242.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 192745584784 + 49687530649 = 439028^2 + 222907^2 .
It is a cyclic number.
It is not a de Polignac number, because 242433115433 - 234 = 225253246249 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 242433115393 and 242433115402.
It is not a weakly prime, because it can be changed into another prime (242433115033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121216557716 + 121216557717.
It is an arithmetic number, because the mean of its divisors is an integer number (121216557717).
Almost surely, 2242433115433 is an apocalyptic number.
It is an amenable number.
242433115433 is a deficient number, since it is larger than the sum of its proper divisors (1).
242433115433 is an equidigital number, since it uses as much as digits as its factorization.
242433115433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 103680, while the sum is 35.
Adding to 242433115433 its reverse (334511334242), we get a palindrome (576944449675).
The spelling of 242433115433 in words is "two hundred forty-two billion, four hundred thirty-three million, one hundred fifteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •