Base | Representation |
---|---|
bin | 1110010001011… |
… | …10111111110001 |
3 | 22100021220220102 |
4 | 13020232333301 |
5 | 221122331121 |
6 | 15514122145 |
7 | 2652455345 |
oct | 710567761 |
9 | 270256812 |
10 | 119730161 |
11 | 61648051 |
12 | 34120355 |
13 | 1ba61165 |
14 | 11c89625 |
15 | a7a090b |
hex | 722eff1 |
119730161 has 2 divisors, whose sum is σ = 119730162. Its totient is φ = 119730160.
The previous prime is 119730151. The next prime is 119730173. The reversal of 119730161 is 161037911.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 103408561 + 16321600 = 10169^2 + 4040^2 .
It is an emirp because it is prime and its reverse (161037911) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 119730161 - 26 = 119730097 is a prime.
It is a super-2 number, since 2×1197301612 = 28670622906171842, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (119730101) 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, 59865080 + 59865081.
It is an arithmetic number, because the mean of its divisors is an integer number (59865081).
Almost surely, 2119730161 is an apocalyptic number.
It is an amenable number.
119730161 is a deficient number, since it is larger than the sum of its proper divisors (1).
119730161 is an equidigital number, since it uses as much as digits as its factorization.
119730161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
The square root of 119730161 is about 10942.1278095259. The cubic root of 119730161 is about 492.8724261791.
The spelling of 119730161 in words is "one hundred nineteen million, seven hundred thirty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •