Base | Representation |
---|---|
bin | 110010111111110110… |
… | …0010001000001100101 |
3 | 101110200101121021022202 |
4 | 1211333230101001211 |
5 | 3243242210233101 |
6 | 122151114304245 |
7 | 10624630554524 |
oct | 1457754210145 |
9 | 343611537282 |
10 | 109516492901 |
11 | 4249a229072 |
12 | 19284a28085 |
13 | a43429ab2a |
14 | 542ccc24bb |
15 | 2cae93b36b |
hex | 197fb11065 |
109516492901 has 2 divisors, whose sum is σ = 109516492902. Its totient is φ = 109516492900.
The previous prime is 109516492889. The next prime is 109516492937. The reversal of 109516492901 is 109294615901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109101393025 + 415099876 = 330305^2 + 20374^2 .
It is a cyclic number.
It is not a de Polignac number, because 109516492901 - 230 = 108442751077 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109516492951) 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, 54758246450 + 54758246451.
It is an arithmetic number, because the mean of its divisors is an integer number (54758246451).
Almost surely, 2109516492901 is an apocalyptic number.
It is an amenable number.
109516492901 is a deficient number, since it is larger than the sum of its proper divisors (1).
109516492901 is an equidigital number, since it uses as much as digits as its factorization.
109516492901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 47.
The spelling of 109516492901 in words is "one hundred nine billion, five hundred sixteen million, four hundred ninety-two thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •