Base | Representation |
---|---|
bin | 1101000001101… |
… | …10101111111101 |
3 | 21121121210201002 |
4 | 12200312233331 |
5 | 210433314112 |
6 | 14502100045 |
7 | 2464555244 |
oct | 640665775 |
9 | 247553632 |
10 | 109276157 |
11 | 56757881 |
12 | 3071a625 |
13 | 19840a63 |
14 | 1072795b |
15 | 98d81c2 |
hex | 6836bfd |
109276157 has 2 divisors, whose sum is σ = 109276158. Its totient is φ = 109276156.
The previous prime is 109276121. The next prime is 109276183. The reversal of 109276157 is 751672901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107723641 + 1552516 = 10379^2 + 1246^2 .
It is a cyclic number.
It is not a de Polignac number, because 109276157 - 26 = 109276093 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 109276157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109276117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54638078 + 54638079.
It is an arithmetic number, because the mean of its divisors is an integer number (54638079).
Almost surely, 2109276157 is an apocalyptic number.
It is an amenable number.
109276157 is a deficient number, since it is larger than the sum of its proper divisors (1).
109276157 is an equidigital number, since it uses as much as digits as its factorization.
109276157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26460, while the sum is 38.
The square root of 109276157 is about 10453.5236642962. The cubic root of 109276157 is about 478.0886914317.
The spelling of 109276157 in words is "one hundred nine million, two hundred seventy-six thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •