Base | Representation |
---|---|
bin | 110010111111110110… |
… | …0010000111110001001 |
3 | 101110200101121021000121 |
4 | 1211333230100332021 |
5 | 3243242210231211 |
6 | 122151114303241 |
7 | 10624630554061 |
oct | 1457754207611 |
9 | 343611537017 |
10 | 109516492681 |
11 | 4249a228992 |
12 | 19284a27b21 |
13 | a43429a9bb |
14 | 542ccc23a1 |
15 | 2cae93b271 |
hex | 197fb10f89 |
109516492681 has 2 divisors, whose sum is σ = 109516492682. Its totient is φ = 109516492680.
The previous prime is 109516492633. The next prime is 109516492703. The reversal of 109516492681 is 186294615901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100245691456 + 9270801225 = 316616^2 + 96285^2 .
It is a cyclic number.
It is not a de Polignac number, because 109516492681 - 213 = 109516484489 is a prime.
It is a super-2 number, since 2×1095164926812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (109516492781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54758246340 + 54758246341.
It is an arithmetic number, because the mean of its divisors is an integer number (54758246341).
Almost surely, 2109516492681 is an apocalyptic number.
It is an amenable number.
109516492681 is a deficient number, since it is larger than the sum of its proper divisors (1).
109516492681 is an equidigital number, since it uses as much as digits as its factorization.
109516492681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 933120, while the sum is 52.
The spelling of 109516492681 in words is "one hundred nine billion, five hundred sixteen million, four hundred ninety-two thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •