Base | Representation |
---|---|
bin | 10000101001010000010… |
… | …111011100111000110101 |
3 | 11001100101001121100011122 |
4 | 100221100113130320311 |
5 | 122220010231010103 |
6 | 2233243041513325 |
7 | 145431445254452 |
oct | 20512027347065 |
9 | 4040331540148 |
10 | 1143809625653 |
11 | 4010a5795192 |
12 | 165817642845 |
13 | 83b261b52a6 |
14 | 3d5099d0829 |
15 | 1eb46b55b38 |
hex | 10a505dce35 |
1143809625653 has 2 divisors, whose sum is σ = 1143809625654. Its totient is φ = 1143809625652.
The previous prime is 1143809625643. The next prime is 1143809625659. The reversal of 1143809625653 is 3565269083411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 603912385924 + 539897239729 = 777118^2 + 734777^2 .
It is a cyclic number.
It is not a de Polignac number, because 1143809625653 - 26 = 1143809625589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1143809625595 and 1143809625604.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1143809625659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571904812826 + 571904812827.
It is an arithmetic number, because the mean of its divisors is an integer number (571904812827).
Almost surely, 21143809625653 is an apocalyptic number.
It is an amenable number.
1143809625653 is a deficient number, since it is larger than the sum of its proper divisors (1).
1143809625653 is an equidigital number, since it uses as much as digits as its factorization.
1143809625653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4665600, while the sum is 53.
The spelling of 1143809625653 in words is "one trillion, one hundred forty-three billion, eight hundred nine million, six hundred twenty-five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •