Base | Representation |
---|---|
bin | 110011000011100100… |
… | …0010001100001101001 |
3 | 101111000002101212212101 |
4 | 1212013020101201221 |
5 | 3244021131303442 |
6 | 122211333013401 |
7 | 10631004315265 |
oct | 1460710214151 |
9 | 344002355771 |
10 | 109641275497 |
11 | 42553707086 |
12 | 192ba784261 |
13 | a4540aa8a0 |
14 | 54416c50a5 |
15 | 2cba888cb7 |
hex | 1987211869 |
109641275497 has 16 divisors (see below), whose sum is σ = 119073789072. Its totient is φ = 100353116160.
The previous prime is 109641275467. The next prime is 109641275521. The reversal of 109641275497 is 794572146901.
It can be written as a sum of positive squares in 8 ways, for example, as 40554307161 + 69086968336 = 201381^2 + 262844^2 .
It is a cyclic number.
It is not a de Polignac number, because 109641275497 - 227 = 109507057769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109641275437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1534123 + ... + 1603999.
It is an arithmetic number, because the mean of its divisors is an integer number (7442111817).
Almost surely, 2109641275497 is an apocalyptic number.
It is an amenable number.
109641275497 is a deficient number, since it is larger than the sum of its proper divisors (9432513575).
109641275497 is a wasteful number, since it uses less digits than its factorization.
109641275497 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70908.
The product of its (nonzero) digits is 3810240, while the sum is 55.
The spelling of 109641275497 in words is "one hundred nine billion, six hundred forty-one million, two hundred seventy-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •