Base | Representation |
---|---|
bin | 10000000110010010010… |
… | …100001010000011001101 |
3 | 10220202110020220102211212 |
4 | 100012102110022003031 |
5 | 121111110401241103 |
6 | 2204113124024205 |
7 | 142632121230002 |
oct | 20062224120315 |
9 | 3822406812755 |
10 | 1106261352653 |
11 | 397187769a06 |
12 | 15a498832065 |
13 | 8042105cb82 |
14 | 3b786ca98a9 |
15 | 1db9a5117d8 |
hex | 1019250a0cd |
1106261352653 has 2 divisors, whose sum is σ = 1106261352654. Its totient is φ = 1106261352652.
The previous prime is 1106261352641. The next prime is 1106261352701. The reversal of 1106261352653 is 3562531626011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 748133312809 + 358128039844 = 864947^2 + 598438^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1106261352653 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1106261352653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1106261351653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 553130676326 + 553130676327.
It is an arithmetic number, because the mean of its divisors is an integer number (553130676327).
Almost surely, 21106261352653 is an apocalyptic number.
It is an amenable number.
1106261352653 is a deficient number, since it is larger than the sum of its proper divisors (1).
1106261352653 is an equidigital number, since it uses as much as digits as its factorization.
1106261352653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 194400, while the sum is 41.
Adding to 1106261352653 its reverse (3562531626011), we get a palindrome (4668792978664).
The spelling of 1106261352653 in words is "one trillion, one hundred six billion, two hundred sixty-one million, three hundred fifty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •