Base | Representation |
---|---|
bin | 10110110000100… |
… | …10110000111001 |
3 | 111022020121211112 |
4 | 23120102300321 |
5 | 342333331224 |
6 | 30540010105 |
7 | 4505526224 |
oct | 1330226071 |
9 | 438217745 |
10 | 190917689 |
11 | 9884a316 |
12 | 53b30935 |
13 | 30727361 |
14 | 1b4da5bb |
15 | 11b6330e |
hex | b612c39 |
190917689 has 4 divisors (see below), whose sum is σ = 195574260. Its totient is φ = 186261120.
The previous prime is 190917611. The next prime is 190917707. The reversal of 190917689 is 986719091.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 986719091 = 103 ⋅9579797.
It can be written as a sum of positive squares in 2 ways, for example, as 29246464 + 161671225 = 5408^2 + 12715^2 .
It is a cyclic number.
It is not a de Polignac number, because 190917689 - 216 = 190852153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (190919689) 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 in 3 ways as a sum of consecutive naturals, for example, 2328224 + ... + 2328305.
It is an arithmetic number, because the mean of its divisors is an integer number (48893565).
Almost surely, 2190917689 is an apocalyptic number.
It is an amenable number.
190917689 is a deficient number, since it is larger than the sum of its proper divisors (4656571).
190917689 is an equidigital number, since it uses as much as digits as its factorization.
190917689 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4656570.
The product of its (nonzero) digits is 244944, while the sum is 50.
The square root of 190917689 is about 13817.2967327187. The cubic root of 190917689 is about 575.8137830796.
The spelling of 190917689 in words is "one hundred ninety million, nine hundred seventeen thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •