Base | Representation |
---|---|
bin | 1100010011010… |
… | …01101100011001 |
3 | 21012011202200122 |
4 | 12021221230121 |
5 | 202404141434 |
6 | 14123443025 |
7 | 2362062206 |
oct | 611515431 |
9 | 235152618 |
10 | 103193369 |
11 | 53282784 |
12 | 2a686475 |
13 | 184c1186 |
14 | d9c2cad |
15 | 90d5c2e |
hex | 6269b19 |
103193369 has 2 divisors, whose sum is σ = 103193370. Its totient is φ = 103193368.
The previous prime is 103193357. The next prime is 103193393. The reversal of 103193369 is 963391301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100000000 + 3193369 = 10000^2 + 1787^2 .
It is a cyclic number.
It is not a de Polignac number, because 103193369 - 28 = 103193113 is a prime.
It is a super-2 number, since 2×1031933692 = 21297742811140322, which contains 22 as substring.
It is a Chen prime.
It is equal to p5934761 and since 103193369 and 5934761 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (103193309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51596684 + 51596685.
It is an arithmetic number, because the mean of its divisors is an integer number (51596685).
Almost surely, 2103193369 is an apocalyptic number.
It is an amenable number.
103193369 is a deficient number, since it is larger than the sum of its proper divisors (1).
103193369 is an equidigital number, since it uses as much as digits as its factorization.
103193369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13122, while the sum is 35.
The square root of 103193369 is about 10158.4137049049. The cubic root of 103193369 is about 469.0479732949.
The spelling of 103193369 in words is "one hundred three million, one hundred ninety-three thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •