Base | Representation |
---|---|
bin | 10000100011011110000… |
… | …001001000101001010101 |
3 | 11000202100000221220021222 |
4 | 100203132001020221111 |
5 | 122114244112040103 |
6 | 2230334322420125 |
7 | 145121460126365 |
oct | 20433601105125 |
9 | 4022300856258 |
10 | 1137596205653 |
11 | 3a94a7445836 |
12 | 164582801645 |
13 | 83375b43acb |
14 | 3d0ba7089a5 |
15 | 1e8d1412638 |
hex | 108de048a55 |
1137596205653 has 2 divisors, whose sum is σ = 1137596205654. Its totient is φ = 1137596205652.
The previous prime is 1137596205611. The next prime is 1137596205719. The reversal of 1137596205653 is 3565026957311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 961197885649 + 176398320004 = 980407^2 + 419998^2 .
It is a cyclic number.
It is not a de Polignac number, because 1137596205653 - 232 = 1133301238357 is a prime.
It is a super-2 number, since 2×11375962056532 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1137596205595 and 1137596205604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1137596205853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 568798102826 + 568798102827.
It is an arithmetic number, because the mean of its divisors is an integer number (568798102827).
Almost surely, 21137596205653 is an apocalyptic number.
It is an amenable number.
1137596205653 is a deficient number, since it is larger than the sum of its proper divisors (1).
1137596205653 is an equidigital number, since it uses as much as digits as its factorization.
1137596205653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5103000, while the sum is 53.
The spelling of 1137596205653 in words is "one trillion, one hundred thirty-seven billion, five hundred ninety-six million, two hundred five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •