Base | Representation |
---|---|
bin | 1101101001110001110… |
… | …1110101110011011001 |
3 | 211102102102102022021222 |
4 | 3122130131311303121 |
5 | 12320331121132413 |
6 | 255430255141425 |
7 | 22642310113325 |
oct | 3323435656331 |
9 | 742372368258 |
10 | 234553302233 |
11 | 90523251628 |
12 | 3955b514875 |
13 | 1916cb31243 |
14 | b4d114c985 |
15 | 617bbb9b08 |
hex | 369c775cd9 |
234553302233 has 2 divisors, whose sum is σ = 234553302234. Its totient is φ = 234553302232.
The previous prime is 234553302211. The next prime is 234553302289. The reversal of 234553302233 is 332203355432.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 172446681289 + 62106620944 = 415267^2 + 249212^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234553302233 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 234553302193 and 234553302202.
It is not a weakly prime, because it can be changed into another prime (234553302133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117276651116 + 117276651117.
It is an arithmetic number, because the mean of its divisors is an integer number (117276651117).
Almost surely, 2234553302233 is an apocalyptic number.
It is an amenable number.
234553302233 is a deficient number, since it is larger than the sum of its proper divisors (1).
234553302233 is an equidigital number, since it uses as much as digits as its factorization.
234553302233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 35.
Adding to 234553302233 its reverse (332203355432), we get a palindrome (566756657665).
The spelling of 234553302233 in words is "two hundred thirty-four billion, five hundred fifty-three million, three hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •