Base | Representation |
---|---|
bin | 1110001100101… |
… | …00111100010001 |
3 | 22022002212022202 |
4 | 13012110330101 |
5 | 220442133103 |
6 | 15452412545 |
7 | 2644216565 |
oct | 706247421 |
9 | 268085282 |
10 | 119099153 |
11 | 61256a58 |
12 | 33a77155 |
13 | 1b89cb94 |
14 | 11b636a5 |
15 | a6c8988 |
hex | 7194f11 |
119099153 has 2 divisors, whose sum is σ = 119099154. Its totient is φ = 119099152.
The previous prime is 119099131. The next prime is 119099159. The reversal of 119099153 is 351990911.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65399569 + 53699584 = 8087^2 + 7328^2 .
It is an emirp because it is prime and its reverse (351990911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 119099153 - 212 = 119095057 is a prime.
It is not a weakly prime, because it can be changed into another prime (119099159) 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, 59549576 + 59549577.
It is an arithmetic number, because the mean of its divisors is an integer number (59549577).
Almost surely, 2119099153 is an apocalyptic number.
It is an amenable number.
119099153 is a deficient number, since it is larger than the sum of its proper divisors (1).
119099153 is an equidigital number, since it uses as much as digits as its factorization.
119099153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935, while the sum is 38.
The square root of 119099153 is about 10913.2558386579. The cubic root of 119099153 is about 492.0050468229.
The spelling of 119099153 in words is "one hundred nineteen million, ninety-nine thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •