Base | Representation |
---|---|
bin | 1110000110010010000… |
… | …0001010101010000001 |
3 | 212011011122011101220111 |
4 | 3201210200022222001 |
5 | 12432013301304213 |
6 | 303133411111321 |
7 | 23333022525553 |
oct | 3414440125201 |
9 | 764148141814 |
10 | 242204322433 |
11 | 9379a031317 |
12 | 3ab358a2541 |
13 | 19abbc87628 |
14 | ba193334d3 |
15 | 647872da3d |
hex | 386480aa81 |
242204322433 has 2 divisors, whose sum is σ = 242204322434. Its totient is φ = 242204322432.
The previous prime is 242204322401. The next prime is 242204322449. The reversal of 242204322433 is 334223402242.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 180652201024 + 61552121409 = 425032^2 + 248097^2 .
It is a cyclic number.
It is not a de Polignac number, because 242204322433 - 25 = 242204322401 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 242204322395 and 242204322404.
It is not a weakly prime, because it can be changed into another prime (242204322533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 121102161216 + 121102161217.
It is an arithmetic number, because the mean of its divisors is an integer number (121102161217).
Almost surely, 2242204322433 is an apocalyptic number.
It is an amenable number.
242204322433 is a deficient number, since it is larger than the sum of its proper divisors (1).
242204322433 is an equidigital number, since it uses as much as digits as its factorization.
242204322433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 31.
Adding to 242204322433 its reverse (334223402242), we get a palindrome (576427724675).
The spelling of 242204322433 in words is "two hundred forty-two billion, two hundred four million, three hundred twenty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •