Base | Representation |
---|---|
bin | 1110001001101100110… |
… | …1000001001111110001 |
3 | 212020112121000210111121 |
4 | 3202123031001033301 |
5 | 12440403221100113 |
6 | 303404433142241 |
7 | 23364535220332 |
oct | 3423315011761 |
9 | 766477023447 |
10 | 243122050033 |
11 | 94120071685 |
12 | 3b1510ba981 |
13 | 19c0714a005 |
14 | baa5186289 |
15 | 64ce0ace8d |
hex | 389b3413f1 |
243122050033 has 2 divisors, whose sum is σ = 243122050034. Its totient is φ = 243122050032.
The previous prime is 243122050021. The next prime is 243122050079. The reversal of 243122050033 is 330050221342.
243122050033 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 can be written as a sum of positive squares in only one way, i.e., 229203477504 + 13918572529 = 478752^2 + 117977^2 .
It is a cyclic number.
It is not a de Polignac number, because 243122050033 - 25 = 243122050001 is a prime.
It is not a weakly prime, because it can be changed into another prime (243123050033) 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, 121561025016 + 121561025017.
It is an arithmetic number, because the mean of its divisors is an integer number (121561025017).
Almost surely, 2243122050033 is an apocalyptic number.
It is an amenable number.
243122050033 is a deficient number, since it is larger than the sum of its proper divisors (1).
243122050033 is an equidigital number, since it uses as much as digits as its factorization.
243122050033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 243122050033 its reverse (330050221342), we get a palindrome (573172271375).
The spelling of 243122050033 in words is "two hundred forty-three billion, one hundred twenty-two million, fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •