Base | Representation |
---|---|
bin | 10111011011101… |
… | …00011100000001 |
3 | 111200212022111202 |
4 | 23231310130001 |
5 | 400304420031 |
6 | 31300550545 |
7 | 4604511044 |
oct | 1355643401 |
9 | 450768452 |
10 | 196560641 |
11 | a0a53a12 |
12 | 559b2455 |
13 | 31951994 |
14 | 1c168c5b |
15 | 123ca2cb |
hex | bb74701 |
196560641 has 4 divisors (see below), whose sum is σ = 196675284. Its totient is φ = 196446000.
The previous prime is 196560629. The next prime is 196560649. The reversal of 196560641 is 146065691.
196560641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 86415616 + 110145025 = 9296^2 + 10495^2 .
It is a cyclic number.
It is not a de Polignac number, because 196560641 - 222 = 192366337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 196560595 and 196560604.
It is not an unprimeable number, because it can be changed into a prime (196560649) 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, 54710 + ... + 58191.
It is an arithmetic number, because the mean of its divisors is an integer number (49168821).
Almost surely, 2196560641 is an apocalyptic number.
It is an amenable number.
196560641 is a deficient number, since it is larger than the sum of its proper divisors (114643).
196560641 is a wasteful number, since it uses less digits than its factorization.
196560641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114642.
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 196560641 is about 14020.0085948618. The cubic root of 196560641 is about 581.4318970387.
The spelling of 196560641 in words is "one hundred ninety-six million, five hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •