Base | Representation |
---|---|
bin | 10111100001110… |
… | …10001100010001 |
3 | 111202101110121202 |
4 | 23300322030101 |
5 | 401011330031 |
6 | 31330200545 |
7 | 4614423416 |
oct | 1360721421 |
9 | 452343552 |
10 | 197370641 |
11 | a1457536 |
12 | 56123155 |
13 | 31b76580 |
14 | 1c2da10d |
15 | 124da2cb |
hex | bc3a311 |
197370641 has 4 divisors (see below), whose sum is σ = 212553012. Its totient is φ = 182188272.
The previous prime is 197370631. The next prime is 197370643. The reversal of 197370641 is 146073791.
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 93412225 + 103958416 = 9665^2 + 10196^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-197370641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 197370595 and 197370604.
It is not an unprimeable number, because it can be changed into a prime (197370643) 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, 7591166 + ... + 7591191.
It is an arithmetic number, because the mean of its divisors is an integer number (53138253).
Almost surely, 2197370641 is an apocalyptic number.
It is an amenable number.
197370641 is a deficient number, since it is larger than the sum of its proper divisors (15182371).
197370641 is a wasteful number, since it uses less digits than its factorization.
197370641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15182370.
The product of its (nonzero) digits is 31752, while the sum is 38.
The square root of 197370641 is about 14048.8661820091. The cubic root of 197370641 is about 582.2294700598.
The spelling of 197370641 in words is "one hundred ninety-seven million, three hundred seventy thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •