Base | Representation |
---|---|
bin | 1101000100100… |
… | …11101101000101 |
3 | 21122100010222201 |
4 | 12202103231011 |
5 | 211033010101 |
6 | 14514154501 |
7 | 2501032264 |
oct | 642235505 |
9 | 248303881 |
10 | 109656901 |
11 | 56997942 |
12 | 30882a31 |
13 | 19945153 |
14 | 107c65db |
15 | 9960e01 |
hex | 6893b45 |
109656901 has 2 divisors, whose sum is σ = 109656902. Its totient is φ = 109656900.
The previous prime is 109656881. The next prime is 109656949.
109656901 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84916225 + 24740676 = 9215^2 + 4974^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 109656901 - 27 = 109656773 is a prime.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109656971) 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, 54828450 + 54828451.
It is an arithmetic number, because the mean of its divisors is an integer number (54828451).
Almost surely, 2109656901 is an apocalyptic number.
It is an amenable number.
109656901 is a deficient number, since it is larger than the sum of its proper divisors (1).
109656901 is an equidigital number, since it uses as much as digits as its factorization.
109656901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14580, while the sum is 37.
The square root of 109656901 is about 10471.7191043305. The cubic root of 109656901 is about 478.6433058533.
The spelling of 109656901 in words is "one hundred nine million, six hundred fifty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •