Base | Representation |
---|---|
bin | 1101000111000… |
… | …01011001100101 |
3 | 21122221022112101 |
4 | 12203201121211 |
5 | 211123201031 |
6 | 14525052101 |
7 | 2503526143 |
oct | 643413145 |
9 | 248838471 |
10 | 109975141 |
11 | 57094a51 |
12 | 309b7031 |
13 | 19a26c63 |
14 | 1086a593 |
15 | 99c5361 |
hex | 68e1665 |
109975141 has 2 divisors, whose sum is σ = 109975142. Its totient is φ = 109975140.
The previous prime is 109975139. The next prime is 109975147. The reversal of 109975141 is 141579901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109202500 + 772641 = 10450^2 + 879^2 .
It is a cyclic number.
It is not a de Polignac number, because 109975141 - 21 = 109975139 is a prime.
Together with 109975139, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 109975141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109975147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54987570 + 54987571.
It is an arithmetic number, because the mean of its divisors is an integer number (54987571).
Almost surely, 2109975141 is an apocalyptic number.
109975141 is the 6633-rd centered pentagonal number.
It is an amenable number.
109975141 is a deficient number, since it is larger than the sum of its proper divisors (1).
109975141 is an equidigital number, since it uses as much as digits as its factorization.
109975141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 37.
The square root of 109975141 is about 10486.9033084128. The cubic root of 109975141 is about 479.1058890760.
The spelling of 109975141 in words is "one hundred nine million, nine hundred seventy-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •