Base | Representation |
---|---|
bin | 110011000101011010… |
… | …0011110100001000101 |
3 | 101111011101220201000221 |
4 | 1212022310132201011 |
5 | 3244133004212233 |
6 | 122221424104341 |
7 | 10632355524601 |
oct | 1461264364105 |
9 | 344141821027 |
10 | 109703194693 |
11 | 42585658974 |
12 | 193174650b1 |
13 | a463b7a271 |
14 | 5449a02501 |
15 | 2cc101a42d |
hex | 198ad1e845 |
109703194693 has 2 divisors, whose sum is σ = 109703194694. Its totient is φ = 109703194692.
The previous prime is 109703194687. The next prime is 109703194703. The reversal of 109703194693 is 396491307901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79683127524 + 30020067169 = 282282^2 + 173263^2 .
It is a cyclic number.
It is not a de Polignac number, because 109703194693 - 217 = 109703063621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 109703194693.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109703194613) 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, 54851597346 + 54851597347.
It is an arithmetic number, because the mean of its divisors is an integer number (54851597347).
Almost surely, 2109703194693 is an apocalyptic number.
It is an amenable number.
109703194693 is a deficient number, since it is larger than the sum of its proper divisors (1).
109703194693 is an equidigital number, since it uses as much as digits as its factorization.
109703194693 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1102248, while the sum is 52.
The spelling of 109703194693 in words is "one hundred nine billion, seven hundred three million, one hundred ninety-four thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •