Base | Representation |
---|---|
bin | 1101000101010… |
… | …11101010001001 |
3 | 21122112010120122 |
4 | 12202223222021 |
5 | 211044130032 |
6 | 14520233025 |
7 | 2501621321 |
oct | 642535211 |
9 | 248463518 |
10 | 109755017 |
11 | 56a54629 |
12 | 3090b775 |
13 | 1997a9c8 |
14 | 10810281 |
15 | 9980012 |
hex | 68aba89 |
109755017 has 4 divisors (see below), whose sum is σ = 110031876. Its totient is φ = 109478160.
The previous prime is 109755013. The next prime is 109755031. The reversal of 109755017 is 710557901.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 710557901 = 991 ⋅717011.
It can be written as a sum of positive squares in 2 ways, for example, as 83704201 + 26050816 = 9149^2 + 5104^2 .
It is a cyclic number.
It is not a de Polignac number, because 109755017 - 22 = 109755013 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109755013) 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 in 3 ways as a sum of consecutive naturals, for example, 137834 + ... + 138627.
It is an arithmetic number, because the mean of its divisors is an integer number (27507969).
Almost surely, 2109755017 is an apocalyptic number.
It is an amenable number.
109755017 is a deficient number, since it is larger than the sum of its proper divisors (276859).
109755017 is an equidigital number, since it uses as much as digits as its factorization.
109755017 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276858.
The product of its (nonzero) digits is 11025, while the sum is 35.
The square root of 109755017 is about 10476.4028654878. The cubic root of 109755017 is about 478.7860193730.
The spelling of 109755017 in words is "one hundred nine million, seven hundred fifty-five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •