Base | Representation |
---|---|
bin | 100000110010111110110… |
… | …111011000100101010001 |
3 | 21222110100202120012111121 |
4 | 200302332313120211101 |
5 | 243411202323142003 |
6 | 4443210530442241 |
7 | 321554253602014 |
oct | 40627667304521 |
9 | 7873322505447 |
10 | 2253765052753 |
11 | 7998a8686985 |
12 | 304965433381 |
13 | 1346b5672916 |
14 | 7b12333737b |
15 | 3d95b60ccbd |
hex | 20cbedd8951 |
2253765052753 has 2 divisors, whose sum is σ = 2253765052754. Its totient is φ = 2253765052752.
The previous prime is 2253765052709. The next prime is 2253765052789. The reversal of 2253765052753 is 3572505673522.
2253765052753 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1842567337744 + 411197715009 = 1357412^2 + 641247^2 .
It is a cyclic number.
It is not a de Polignac number, because 2253765052753 - 213 = 2253765044561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2253765052753.
It is not a weakly prime, because it can be changed into another prime (2253765052153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1126882526376 + 1126882526377.
It is an arithmetic number, because the mean of its divisors is an integer number (1126882526377).
Almost surely, 22253765052753 is an apocalyptic number.
It is an amenable number.
2253765052753 is a deficient number, since it is larger than the sum of its proper divisors (1).
2253765052753 is an equidigital number, since it uses as much as digits as its factorization.
2253765052753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13230000, while the sum is 52.
The spelling of 2253765052753 in words is "two trillion, two hundred fifty-three billion, seven hundred sixty-five million, fifty-two thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •