Base | Representation |
---|---|
bin | 101110001101100011001110… |
… | …111000110101011011100101 |
3 | 222122121200101021112220001002 |
4 | 232031203032320311123211 |
5 | 203114401212300432013 |
6 | 2000131435224043045 |
7 | 60544462314134501 |
oct | 5615431670653345 |
9 | 878550337486032 |
10 | 203241323452133 |
11 | 5983918566445a |
12 | 1a965644003485 |
13 | 8953761419c75 |
14 | 3828d0ac73301 |
15 | 1876b8ea13358 |
hex | b8d8cee356e5 |
203241323452133 has 2 divisors, whose sum is σ = 203241323452134. Its totient is φ = 203241323452132.
The previous prime is 203241323452093. The next prime is 203241323452201. The reversal of 203241323452133 is 331254323142302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 192872710931044 + 10368612521089 = 13887862^2 + 3220033^2 .
It is a cyclic number.
It is not a de Polignac number, because 203241323452133 - 214 = 203241323435749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203241320452133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101620661726066 + 101620661726067.
It is an arithmetic number, because the mean of its divisors is an integer number (101620661726067).
Almost surely, 2203241323452133 is an apocalyptic number.
It is an amenable number.
203241323452133 is a deficient number, since it is larger than the sum of its proper divisors (1).
203241323452133 is an equidigital number, since it uses as much as digits as its factorization.
203241323452133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 38.
Adding to 203241323452133 its reverse (331254323142302), we get a palindrome (534495646594435).
The spelling of 203241323452133 in words is "two hundred three trillion, two hundred forty-one billion, three hundred twenty-three million, four hundred fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •