Base | Representation |
---|---|
bin | 110111110101101110… |
… | …1111001111001110111 |
3 | 102110112001110221121101 |
4 | 1233223131321321313 |
5 | 3431041114231403 |
6 | 131031002030531 |
7 | 11443411204642 |
oct | 1575335717167 |
9 | 373461427541 |
10 | 119914602103 |
11 | 4694573744a |
12 | 1b2a71a8447 |
13 | b4005b707a |
14 | 5b37c76a59 |
15 | 31bc73771d |
hex | 1beb779e77 |
119914602103 has 2 divisors, whose sum is σ = 119914602104. Its totient is φ = 119914602102.
The previous prime is 119914602079. The next prime is 119914602107. The reversal of 119914602103 is 301206419911.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-119914602103 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (119914602107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 59957301051 + 59957301052.
It is an arithmetic number, because the mean of its divisors is an integer number (59957301052).
Almost surely, 2119914602103 is an apocalyptic number.
119914602103 is a deficient number, since it is larger than the sum of its proper divisors (1).
119914602103 is an equidigital number, since it uses as much as digits as its factorization.
119914602103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 119914602103 in words is "one hundred nineteen billion, nine hundred fourteen million, six hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •