Base | Representation |
---|---|
bin | 110010111001110000… |
… | …0110010011000110111 |
3 | 101110011011002221111021 |
4 | 1211303200302120313 |
5 | 3242332403012424 |
6 | 122114534522011 |
7 | 10616600001655 |
oct | 1456340623067 |
9 | 343134087437 |
10 | 109312157239 |
11 | 423a495471a |
12 | 19228506307 |
13 | a400b5625c |
14 | 540dad1dd5 |
15 | 2c9ba274e4 |
hex | 1973832637 |
109312157239 has 2 divisors, whose sum is σ = 109312157240. Its totient is φ = 109312157238.
The previous prime is 109312157231. The next prime is 109312157261. The reversal of 109312157239 is 932751213901.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 109312157239 - 23 = 109312157231 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 109312157195 and 109312157204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109312157231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54656078619 + 54656078620.
It is an arithmetic number, because the mean of its divisors is an integer number (54656078620).
Almost surely, 2109312157239 is an apocalyptic number.
109312157239 is a deficient number, since it is larger than the sum of its proper divisors (1).
109312157239 is an equidigital number, since it uses as much as digits as its factorization.
109312157239 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 102060, while the sum is 43.
The spelling of 109312157239 in words is "one hundred nine billion, three hundred twelve million, one hundred fifty-seven thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •