Base | Representation |
---|---|
bin | 1101100100110110111… |
… | …1111100110101000101 |
3 | 211022000101101012101022 |
4 | 3121031233330311011 |
5 | 12310130024241131 |
6 | 255051241040525 |
7 | 22564502545043 |
oct | 3311557746505 |
9 | 738011335338 |
10 | 233232649541 |
11 | 8aa05828721 |
12 | 39251186145 |
13 | 18cbc344a48 |
14 | b4079b3393 |
15 | 6100c9a37b |
hex | 364dbfcd45 |
233232649541 has 2 divisors, whose sum is σ = 233232649542. Its totient is φ = 233232649540.
The previous prime is 233232649469. The next prime is 233232649543. The reversal of 233232649541 is 145946232332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 229541601025 + 3691048516 = 479105^2 + 60754^2 .
It is a cyclic number.
It is not a de Polignac number, because 233232649541 - 214 = 233232633157 is a prime.
Together with 233232649543, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 233232649492 and 233232649501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (233232649543) 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, 116616324770 + 116616324771.
It is an arithmetic number, because the mean of its divisors is an integer number (116616324771).
Almost surely, 2233232649541 is an apocalyptic number.
It is an amenable number.
233232649541 is a deficient number, since it is larger than the sum of its proper divisors (1).
233232649541 is an equidigital number, since it uses as much as digits as its factorization.
233232649541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 933120, while the sum is 44.
The spelling of 233232649541 in words is "two hundred thirty-three billion, two hundred thirty-two million, six hundred forty-nine thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •