Base | Representation |
---|---|
bin | 10110101110001… |
… | …10100110001001 |
3 | 111021122202212120 |
4 | 23113012212021 |
5 | 342243340310 |
6 | 30525201453 |
7 | 4503056523 |
oct | 1327064611 |
9 | 437582776 |
10 | 190605705 |
11 | 98656984 |
12 | 53a00289 |
13 | 30648354 |
14 | 1b458a13 |
15 | 11b00b70 |
hex | b5c6989 |
190605705 has 8 divisors (see below), whose sum is σ = 304969152. Its totient is φ = 101656368.
The previous prime is 190605703. The next prime is 190605707. The reversal of 190605705 is 507506091.
190605705 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (190605703) and next prime (190605707).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 190605705 - 21 = 190605703 is a prime.
It is not an unprimeable number, because it can be changed into a prime (190605703) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6353509 + ... + 6353538.
It is an arithmetic number, because the mean of its divisors is an integer number (38121144).
Almost surely, 2190605705 is an apocalyptic number.
190605705 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
190605705 is a deficient number, since it is larger than the sum of its proper divisors (114363447).
190605705 is a wasteful number, since it uses less digits than its factorization.
190605705 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12707055.
The product of its (nonzero) digits is 9450, while the sum is 33.
The square root of 190605705 is about 13806.0024989133. The cubic root of 190605705 is about 575.4999608746.
The spelling of 190605705 in words is "one hundred ninety million, six hundred five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •