Base | Representation |
---|---|
bin | 10111100001000… |
… | …01001010000101 |
3 | 111202012020221222 |
4 | 23300201022011 |
5 | 401000034401 |
6 | 31324050125 |
7 | 4613515442 |
oct | 1360411205 |
9 | 452166858 |
10 | 197268101 |
11 | a1397498 |
12 | 56093945 |
13 | 31b3b9b4 |
14 | 1c2b09c9 |
15 | 124b9c1b |
hex | bc21285 |
197268101 has 4 divisors (see below), whose sum is σ = 197428812. Its totient is φ = 197107392.
The previous prime is 197268077. The next prime is 197268131. The reversal of 197268101 is 101862791.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 101862791 = 23 ⋅4428817.
It can be written as a sum of positive squares in 2 ways, for example, as 70728100 + 126540001 = 8410^2 + 11249^2 .
It is a cyclic number.
It is not a de Polignac number, because 197268101 - 218 = 197005957 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 (197268131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 78500 + ... + 80973.
It is an arithmetic number, because the mean of its divisors is an integer number (49357203).
Almost surely, 2197268101 is an apocalyptic number.
It is an amenable number.
197268101 is a deficient number, since it is larger than the sum of its proper divisors (160711).
197268101 is a wasteful number, since it uses less digits than its factorization.
197268101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160710.
The product of its (nonzero) digits is 6048, while the sum is 35.
The square root of 197268101 is about 14045.2163030692. The cubic root of 197268101 is about 582.1286240044.
The spelling of 197268101 in words is "one hundred ninety-seven million, two hundred sixty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •