Base | Representation |
---|---|
bin | 1110010001000… |
… | …00100001101001 |
3 | 22100011220121011 |
4 | 13020200201221 |
5 | 221113432024 |
6 | 15512543521 |
7 | 2652120502 |
oct | 710404151 |
9 | 270156534 |
10 | 119670889 |
11 | 61607568 |
12 | 340b1ba1 |
13 | 1ba401a0 |
14 | 11c71ba9 |
15 | a78d094 |
hex | 7220869 |
119670889 has 4 divisors (see below), whose sum is σ = 128876356. Its totient is φ = 110465424.
The previous prime is 119670853. The next prime is 119670899. The reversal of 119670889 is 988076911.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 988076911 = 47 ⋅21022913.
It can be written as a sum of positive squares in 2 ways, for example, as 23474025 + 96196864 = 4845^2 + 9808^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-119670889 is a prime.
It is a super-2 number, since 2×1196708892 = 28642243348100642, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (119670809) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4602714 + ... + 4602739.
It is an arithmetic number, because the mean of its divisors is an integer number (32219089).
Almost surely, 2119670889 is an apocalyptic number.
It is an amenable number.
119670889 is a deficient number, since it is larger than the sum of its proper divisors (9205467).
119670889 is an equidigital number, since it uses as much as digits as its factorization.
119670889 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9205466.
The product of its (nonzero) digits is 217728, while the sum is 49.
The square root of 119670889 is about 10939.4190430754. The cubic root of 119670889 is about 492.7910811607.
The spelling of 119670889 in words is "one hundred nineteen million, six hundred seventy thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •