Base | Representation |
---|---|
bin | 10111011100011… |
… | …10111011011011 |
3 | 111201001211100111 |
4 | 23232032323123 |
5 | 400321403042 |
6 | 31303145151 |
7 | 4605442303 |
oct | 1356167333 |
9 | 451054314 |
10 | 196669147 |
11 | a1018494 |
12 | 55a451b7 |
13 | 3198c19c |
14 | 1c196603 |
15 | 123ec517 |
hex | bb8eedb |
196669147 has 2 divisors, whose sum is σ = 196669148. Its totient is φ = 196669146.
The previous prime is 196669139. The next prime is 196669153. The reversal of 196669147 is 741966691.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 196669147 - 23 = 196669139 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 196669147.
It is not a weakly prime, because it can be changed into another prime (196669547) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 98334573 + 98334574.
It is an arithmetic number, because the mean of its divisors is an integer number (98334574).
Almost surely, 2196669147 is an apocalyptic number.
196669147 is a deficient number, since it is larger than the sum of its proper divisors (1).
196669147 is an equidigital number, since it uses as much as digits as its factorization.
196669147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 489888, while the sum is 49.
The square root of 196669147 is about 14023.8777447609. The cubic root of 196669147 is about 581.5388652900.
The spelling of 196669147 in words is "one hundred ninety-six million, six hundred sixty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •