Base | Representation |
---|---|
bin | 10111011100110… |
… | …10000000001011 |
3 | 111201011010120111 |
4 | 23232122000023 |
5 | 400324331012 |
6 | 31304135151 |
7 | 4606021453 |
oct | 1356320013 |
9 | 451133514 |
10 | 196714507 |
11 | a1049580 |
12 | 55a674b7 |
13 | 319a6a22 |
14 | 1c1a8d63 |
15 | 1240aba7 |
hex | bb9a00b |
196714507 has 8 divisors (see below), whose sum is σ = 214709040. Its totient is φ = 178738560.
The previous prime is 196714501. The next prime is 196714513. The reversal of 196714507 is 705417691.
It is an interprime number because it is at equal distance from previous prime (196714501) and next prime (196714513).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 196714507 - 215 = 196681739 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 196714507.
It is not an unprimeable number, because it can be changed into a prime (196714501) 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 7 ways as a sum of consecutive naturals, for example, 26743 + ... + 33295.
It is an arithmetic number, because the mean of its divisors is an integer number (26838630).
Almost surely, 2196714507 is an apocalyptic number.
196714507 is a deficient number, since it is larger than the sum of its proper divisors (17994533).
196714507 is a wasteful number, since it uses less digits than its factorization.
196714507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9293.
The product of its (nonzero) digits is 52920, while the sum is 40.
The square root of 196714507 is about 14025.4948932293. The cubic root of 196714507 is about 581.5835707859.
The spelling of 196714507 in words is "one hundred ninety-six million, seven hundred fourteen thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •