Base | Representation |
---|---|
bin | 10111011111001… |
… | …11011100100001 |
3 | 111201202020200212 |
4 | 23233213130201 |
5 | 400420003323 |
6 | 31315023505 |
7 | 4611512324 |
oct | 1357473441 |
9 | 451666625 |
10 | 197031713 |
11 | a124592a |
12 | 55b9ab95 |
13 | 31a88218 |
14 | 1c24c7bb |
15 | 1246eb78 |
hex | bbe7721 |
197031713 has 8 divisors (see below), whose sum is σ = 204957480. Its totient is φ = 189181440.
The previous prime is 197031707. The next prime is 197031721. The reversal of 197031713 is 317130791.
It can be written as a sum of positive squares in 4 ways, for example, as 134689 + 196897024 = 367^2 + 14032^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 197031713 - 218 = 196769569 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 197031713.
It is not an unprimeable number, because it can be changed into a prime (197031733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13520 + ... + 24017.
It is an arithmetic number, because the mean of its divisors is an integer number (25619685).
Almost surely, 2197031713 is an apocalyptic number.
It is an amenable number.
197031713 is a deficient number, since it is larger than the sum of its proper divisors (7925767).
197031713 is a wasteful number, since it uses less digits than its factorization.
197031713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37747.
The product of its (nonzero) digits is 3969, while the sum is 32.
The square root of 197031713 is about 14036.7985310041. The cubic root of 197031713 is about 581.8960078798.
The spelling of 197031713 in words is "one hundred ninety-seven million, thirty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •