Base | Representation |
---|---|
bin | 110101000001101010010000… |
… | …010000101001010111011101 |
3 | 1010120201201012112002000000012 |
4 | 311001222100100221113131 |
5 | 221031410203424133203 |
6 | 2143555241050213005 |
7 | 100056622642121414 |
oct | 6501522020512735 |
9 | 1116651175060005 |
10 | 233210554521053 |
11 | 6834304a27114a |
12 | 221a5926a24165 |
13 | a01887909b905 |
14 | 4183645a1647b |
15 | 1be651d426bd8 |
hex | d41a904295dd |
233210554521053 has 2 divisors, whose sum is σ = 233210554521054. Its totient is φ = 233210554521052.
The previous prime is 233210554521047. The next prime is 233210554521067. The reversal of 233210554521053 is 350125455012332.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 232127712404644 + 1082842116409 = 15235738^2 + 1040597^2 .
It is a cyclic number.
It is not a de Polignac number, because 233210554521053 - 218 = 233210554258909 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 233210554521053.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (233210554521083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116605277260526 + 116605277260527.
It is an arithmetic number, because the mean of its divisors is an integer number (116605277260527).
Almost surely, 2233210554521053 is an apocalyptic number.
It is an amenable number.
233210554521053 is a deficient number, since it is larger than the sum of its proper divisors (1).
233210554521053 is an equidigital number, since it uses as much as digits as its factorization.
233210554521053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540000, while the sum is 41.
The spelling of 233210554521053 in words is "two hundred thirty-three trillion, two hundred ten billion, five hundred fifty-four million, five hundred twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •