Base | Representation |
---|---|
bin | 110000010001001010… |
… | …1011001010101101101 |
3 | 100220112220122020120222 |
4 | 1200202111121111231 |
5 | 3144241220434021 |
6 | 115341335421125 |
7 | 10326450036614 |
oct | 1404225312555 |
9 | 326486566528 |
10 | 103655249261 |
11 | 3aa6175aa63 |
12 | 18109b247a5 |
13 | 9a0bb95325 |
14 | 50346b287b |
15 | 2a6a0b16ab |
hex | 182255956d |
103655249261 has 2 divisors, whose sum is σ = 103655249262. Its totient is φ = 103655249260.
The previous prime is 103655249237. The next prime is 103655249267. The reversal of 103655249261 is 162942556301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 66702876361 + 36952372900 = 258269^2 + 192230^2 .
It is a cyclic number.
It is not a de Polignac number, because 103655249261 - 26 = 103655249197 is a prime.
It is a super-2 number, since 2×1036552492612 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103655249267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51827624630 + 51827624631.
It is an arithmetic number, because the mean of its divisors is an integer number (51827624631).
Almost surely, 2103655249261 is an apocalyptic number.
It is an amenable number.
103655249261 is a deficient number, since it is larger than the sum of its proper divisors (1).
103655249261 is an equidigital number, since it uses as much as digits as its factorization.
103655249261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 44.
The spelling of 103655249261 in words is "one hundred three billion, six hundred fifty-five million, two hundred forty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •