Base | Representation |
---|---|
bin | 1110010001001… |
… | …00111101101101 |
3 | 22100012211112111 |
4 | 13020210331231 |
5 | 221120022234 |
6 | 15513204021 |
7 | 2652224503 |
oct | 710447555 |
9 | 270184474 |
10 | 119689069 |
11 | 6161a195 |
12 | 34100611 |
13 | 1ba48546 |
14 | 11c78673 |
15 | a793664 |
hex | 7224f6d |
119689069 has 4 divisors (see below), whose sum is σ = 121033980. Its totient is φ = 118344160.
The previous prime is 119689051. The next prime is 119689103. The reversal of 119689069 is 960986911.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 960986911 = 137 ⋅7014503.
It can be written as a sum of positive squares in 2 ways, for example, as 16402500 + 103286569 = 4050^2 + 10163^2 .
It is a cyclic number.
It is not a de Polignac number, because 119689069 - 29 = 119688557 is a prime.
It is a super-2 number, since 2×1196890692 = 28650946476173522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (119689019) 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, 672322 + ... + 672499.
It is an arithmetic number, because the mean of its divisors is an integer number (30258495).
Almost surely, 2119689069 is an apocalyptic number.
It is an amenable number.
119689069 is a deficient number, since it is larger than the sum of its proper divisors (1344911).
119689069 is an equidigital number, since it uses as much as digits as its factorization.
119689069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1344910.
The product of its (nonzero) digits is 209952, while the sum is 49.
The square root of 119689069 is about 10940.2499514408. The cubic root of 119689069 is about 492.8160342864.
The spelling of 119689069 in words is "one hundred nineteen million, six hundred eighty-nine thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •