Base | Representation |
---|---|
bin | 110010110100011110… |
… | …0011101001110001001 |
3 | 101102200210111101001001 |
4 | 1211220330131032021 |
5 | 3242002011024233 |
6 | 122045202455001 |
7 | 10612315004611 |
oct | 1455074351611 |
9 | 342623441031 |
10 | 109134861193 |
11 | 42313869566 |
12 | 19199064461 |
13 | a3a31bb057 |
14 | 53d433da41 |
15 | 2c8b1a527d |
hex | 1968f1d389 |
109134861193 has 2 divisors, whose sum is σ = 109134861194. Its totient is φ = 109134861192.
The previous prime is 109134861169. The next prime is 109134861263. The reversal of 109134861193 is 391168431901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97576891129 + 11557970064 = 312373^2 + 107508^2 .
It is a cyclic number.
It is not a de Polignac number, because 109134861193 - 217 = 109134730121 is a prime.
It is not a weakly prime, because it can be changed into another prime (109134871193) 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, 54567430596 + 54567430597.
It is an arithmetic number, because the mean of its divisors is an integer number (54567430597).
Almost surely, 2109134861193 is an apocalyptic number.
It is an amenable number.
109134861193 is a deficient number, since it is larger than the sum of its proper divisors (1).
109134861193 is an equidigital number, since it uses as much as digits as its factorization.
109134861193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 46.
The spelling of 109134861193 in words is "one hundred nine billion, one hundred thirty-four million, eight hundred sixty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •