Base | Representation |
---|---|
bin | 10111100101000… |
… | …10000100101111 |
3 | 111210012002022002 |
4 | 23302202010233 |
5 | 401113434033 |
6 | 31343242515 |
7 | 4621145066 |
oct | 1362420457 |
9 | 453162262 |
10 | 197796143 |
11 | a1718196 |
12 | 562a943b |
13 | 31c9514c |
14 | 1c3ab1dd |
15 | 125713e8 |
hex | bca212f |
197796143 has 4 divisors (see below), whose sum is σ = 201148680. Its totient is φ = 194443608.
The previous prime is 197796133. The next prime is 197796167. The reversal of 197796143 is 341697791.
197796143 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, and also an emirpimes, since its reverse is a distinct semiprime: 341697791 = 991 ⋅344801.
It is a cyclic number.
It is not a de Polignac number, because 197796143 - 28 = 197795887 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (197796133) 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, 1676180 + ... + 1676297.
It is an arithmetic number, because the mean of its divisors is an integer number (50287170).
Almost surely, 2197796143 is an apocalyptic number.
197796143 is a deficient number, since it is larger than the sum of its proper divisors (3352537).
197796143 is an equidigital number, since it uses as much as digits as its factorization.
197796143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3352536.
The product of its digits is 285768, while the sum is 47.
The square root of 197796143 is about 14064.0016709328. The cubic root of 197796143 is about 582.6475700459.
Subtracting from 197796143 its sum of digits (47), we obtain a square (197796096 = 140642).
The spelling of 197796143 in words is "one hundred ninety-seven million, seven hundred ninety-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •