Base | Representation |
---|---|
bin | 10111011011100… |
… | …10100100101001 |
3 | 111200211221000210 |
4 | 23231302210221 |
5 | 400304144001 |
6 | 31300451333 |
7 | 4604446551 |
oct | 1355624451 |
9 | 450757023 |
10 | 196553001 |
11 | a0a491a7 |
12 | 559a9b49 |
13 | 3194b368 |
14 | 1c166161 |
15 | 123c7dd6 |
hex | bb72929 |
196553001 has 4 divisors (see below), whose sum is σ = 262070672. Its totient is φ = 131035332.
The previous prime is 196552999. The next prime is 196553003. The reversal of 196553001 is 100355691.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (196552999) and next prime (196553003).
It is not a de Polignac number, because 196553001 - 21 = 196552999 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 196553001.
It is not an unprimeable number, because it can be changed into a prime (196553003) 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, 32758831 + ... + 32758836.
It is an arithmetic number, because the mean of its divisors is an integer number (65517668).
Almost surely, 2196553001 is an apocalyptic number.
It is an amenable number.
196553001 is a deficient number, since it is larger than the sum of its proper divisors (65517671).
196553001 is an equidigital number, since it uses as much as digits as its factorization.
196553001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65517670.
The product of its (nonzero) digits is 4050, while the sum is 30.
The square root of 196553001 is about 14019.7361244782. The cubic root of 196553001 is about 581.4243638296.
The spelling of 196553001 in words is "one hundred ninety-six million, five hundred fifty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.287 sec. • engine limits •