Base | Representation |
---|---|
bin | 10111001100101… |
… | …10100010010101 |
3 | 111120011212100100 |
4 | 23212112202111 |
5 | 344304300112 |
6 | 31151004313 |
7 | 4552046100 |
oct | 1346264225 |
9 | 446155310 |
10 | 194603157 |
11 | 9a937261 |
12 | 55209699 |
13 | 314179c8 |
14 | 1bbb9737 |
15 | 121402dc |
hex | b996895 |
194603157 has 36 divisors (see below), whose sum is σ = 329475276. Its totient is φ = 110355840.
The previous prime is 194603141. The next prime is 194603159. The reversal of 194603157 is 751306491.
194603157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 132917841 + 61685316 = 11529^2 + 7854^2 .
It is not a de Polignac number, because 194603157 - 24 = 194603141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (194603159) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 58807 + ... + 62027.
It is an arithmetic number, because the mean of its divisors is an integer number (9152091).
Almost surely, 2194603157 is an apocalyptic number.
It is an amenable number.
194603157 is a deficient number, since it is larger than the sum of its proper divisors (134872119).
194603157 is a wasteful number, since it uses less digits than its factorization.
194603157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3378 (or 3368 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 194603157 is about 13950.0235483672. The cubic root of 194603157 is about 579.4953567298.
It can be divided in two parts, 194 and 603157, that added together give a triangular number (603351 = T1098).
The spelling of 194603157 in words is "one hundred ninety-four million, six hundred three thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •