Base | Representation |
---|---|
bin | 10111011100001… |
… | …00101111110011 |
3 | 111200222201010220 |
4 | 23232010233303 |
5 | 400314034233 |
6 | 31302224123 |
7 | 4605206565 |
oct | 1356045763 |
9 | 450881126 |
10 | 196627443 |
11 | a0a9a121 |
12 | 55a25043 |
13 | 319761cc |
14 | 1c185335 |
15 | 123deeb3 |
hex | bb84bf3 |
196627443 has 8 divisors (see below), whose sum is σ = 262235856. Its totient is φ = 131052000.
The previous prime is 196627429. The next prime is 196627477. The reversal of 196627443 is 344726691.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 196627443 - 212 = 196623347 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 196627395 and 196627404.
It is not an unprimeable number, because it can be changed into a prime (196627493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15213 + ... + 24993.
It is an arithmetic number, because the mean of its divisors is an integer number (32779482).
Almost surely, 2196627443 is an apocalyptic number.
196627443 is a deficient number, since it is larger than the sum of its proper divisors (65608413).
196627443 is an equidigital number, since it uses as much as digits as its factorization.
196627443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16485.
The product of its digits is 217728, while the sum is 42.
The square root of 196627443 is about 14022.3907733311. The cubic root of 196627443 is about 581.4977569758.
The spelling of 196627443 in words is "one hundred ninety-six million, six hundred twenty-seven thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •