Base | Representation |
---|---|
bin | 10111011010001… |
… | …00111010000101 |
3 | 111200111102110020 |
4 | 23231010322011 |
5 | 400232202312 |
6 | 31252445353 |
7 | 4603040334 |
oct | 1355047205 |
9 | 450442406 |
10 | 196365957 |
11 | a0930717 |
12 | 55919859 |
13 | 318b4198 |
14 | 1c117d1b |
15 | 1238c78c |
hex | bb44e85 |
196365957 has 4 divisors (see below), whose sum is σ = 261821280. Its totient is φ = 130910636.
The previous prime is 196365943. The next prime is 196365971. The reversal of 196365957 is 759563691.
196365957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (196365943) and next prime (196365971).
It is a cyclic number.
It is not a de Polignac number, because 196365957 - 210 = 196364933 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196325957) 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, 32727657 + ... + 32727662.
It is an arithmetic number, because the mean of its divisors is an integer number (65455320).
Almost surely, 2196365957 is an apocalyptic number.
It is an amenable number.
196365957 is a deficient number, since it is larger than the sum of its proper divisors (65455323).
196365957 is an equidigital number, since it uses as much as digits as its factorization.
196365957 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65455322.
The product of its digits is 1530900, while the sum is 51.
The square root of 196365957 is about 14013.0637977567. The cubic root of 196365957 is about 581.2398733812.
The spelling of 196365957 in words is "one hundred ninety-six million, three hundred sixty-five thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •