Base | Representation |
---|---|
bin | 10111011001000… |
… | …01100110000110 |
3 | 111200020002001020 |
4 | 23230201212012 |
5 | 400213040233 |
6 | 31245412010 |
7 | 4601565546 |
oct | 1354414606 |
9 | 450202036 |
10 | 196221318 |
11 | a0841a87 |
12 | 5586a006 |
13 | 318633b7 |
14 | 1c0bb326 |
15 | 1235e9b3 |
hex | bb21986 |
196221318 has 8 divisors (see below), whose sum is σ = 392442648. Its totient is φ = 65407104.
The previous prime is 196221313. The next prime is 196221331. The reversal of 196221318 is 813122691.
It is a sphenic number, since it is the product of 3 distinct primes.
196221318 is an admirable number.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196221313) 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, 16351771 + ... + 16351782.
It is an arithmetic number, because the mean of its divisors is an integer number (49055331).
Almost surely, 2196221318 is an apocalyptic number.
196221318 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196221318 is a wasteful number, since it uses less digits than its factorization.
196221318 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32703558.
The product of its digits is 5184, while the sum is 33.
The square root of 196221318 is about 14007.9019842373. The cubic root of 196221318 is about 581.0971286727.
The spelling of 196221318 in words is "one hundred ninety-six million, two hundred twenty-one thousand, three hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •