Base | Representation |
---|---|
bin | 10111011110111… |
… | …01101000010011 |
3 | 111201200012112202 |
4 | 23233131220103 |
5 | 400412212012 |
6 | 31314113415 |
7 | 4611254156 |
oct | 1357355023 |
9 | 451605482 |
10 | 196991507 |
11 | a12186a9 |
12 | 55b7b86b |
13 | 31a72b2b |
14 | 1c23bc9d |
15 | 12462cc2 |
hex | bbdda13 |
196991507 has 2 divisors, whose sum is σ = 196991508. Its totient is φ = 196991506.
The previous prime is 196991503. The next prime is 196991537. The reversal of 196991507 is 705199691.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 196991507 - 22 = 196991503 is a prime.
It is not a weakly prime, because it can be changed into another prime (196991503) 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 as a sum of consecutive naturals, namely, 98495753 + 98495754.
It is an arithmetic number, because the mean of its divisors is an integer number (98495754).
Almost surely, 2196991507 is an apocalyptic number.
196991507 is a deficient number, since it is larger than the sum of its proper divisors (1).
196991507 is an equidigital number, since it uses as much as digits as its factorization.
196991507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 153090, while the sum is 47.
The square root of 196991507 is about 14035.3662937595. The cubic root of 196991507 is about 581.8564249076.
The spelling of 196991507 in words is "one hundred ninety-six million, nine hundred ninety-one thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •