Base | Representation |
---|---|
bin | 110100110011011100010110… |
… | …011001001001011101111101 |
3 | 1010110021022101120010111022021 |
4 | 310303130112121021131331 |
5 | 220414403303400300044 |
6 | 2141530342055120141 |
7 | 66626214630532504 |
oct | 6463342631113575 |
9 | 1113238346114267 |
10 | 232233552353149 |
11 | 67aa6772a94966 |
12 | 22068502973051 |
13 | 9c776b75b3559 |
14 | 414c241a9583b |
15 | 1bcaddabe2e84 |
hex | d3371664977d |
232233552353149 has 2 divisors, whose sum is σ = 232233552353150. Its totient is φ = 232233552353148.
The previous prime is 232233552353107. The next prime is 232233552353197. The reversal of 232233552353149 is 941353255332232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157334826449124 + 74898725904025 = 12543318^2 + 8654405^2 .
It is a cyclic number.
It is not a de Polignac number, because 232233552353149 - 221 = 232233550255997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 232233552353096 and 232233552353105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (232233552353449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116116776176574 + 116116776176575.
It is an arithmetic number, because the mean of its divisors is an integer number (116116776176575).
Almost surely, 2232233552353149 is an apocalyptic number.
It is an amenable number.
232233552353149 is a deficient number, since it is larger than the sum of its proper divisors (1).
232233552353149 is an equidigital number, since it uses as much as digits as its factorization.
232233552353149 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 17496000, while the sum is 52.
The spelling of 232233552353149 in words is "two hundred thirty-two trillion, two hundred thirty-three billion, five hundred fifty-two million, three hundred fifty-three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •