Base | Representation |
---|---|
bin | 10111011001100… |
… | …11000100100001 |
3 | 111200100201020022 |
4 | 23230303010201 |
5 | 400222333042 |
6 | 31251123225 |
7 | 4602314333 |
oct | 1354630441 |
9 | 450321208 |
10 | 196292897 |
11 | a0890839 |
12 | 558a3515 |
13 | 31889b58 |
14 | 1c0d9453 |
15 | 12375cd2 |
hex | bb33121 |
196292897 has 4 divisors (see below), whose sum is σ = 207839556. Its totient is φ = 184746240.
The previous prime is 196292849. The next prime is 196292911. The reversal of 196292897 is 798292691.
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 59660176 + 136632721 = 7724^2 + 11689^2 .
It is a cyclic number.
It is not a de Polignac number, because 196292897 - 210 = 196291873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (196292827) 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, 5773304 + ... + 5773337.
It is an arithmetic number, because the mean of its divisors is an integer number (51959889).
Almost surely, 2196292897 is an apocalyptic number.
196292897 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
196292897 is a deficient number, since it is larger than the sum of its proper divisors (11546659).
196292897 is a wasteful number, since it uses less digits than its factorization.
196292897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11546658.
The product of its digits is 979776, while the sum is 53.
The square root of 196292897 is about 14010.4567020494. The cubic root of 196292897 is about 581.1677789893.
The spelling of 196292897 in words is "one hundred ninety-six million, two hundred ninety-two thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •