Base | Representation |
---|---|
bin | 10111011110111… |
… | …10000110111101 |
3 | 111201200022020102 |
4 | 23233132012331 |
5 | 400412242334 |
6 | 31314130445 |
7 | 4611262661 |
oct | 1357360675 |
9 | 451608212 |
10 | 196993469 |
11 | a121a122 |
12 | 55b80a25 |
13 | 31a739aa |
14 | 1c23c8a1 |
15 | 1246367e |
hex | bbde1bd |
196993469 has 2 divisors, whose sum is σ = 196993470. Its totient is φ = 196993468.
The previous prime is 196993457. The next prime is 196993481. The reversal of 196993469 is 964399691.
It is a balanced prime because it is at equal distance from previous prime (196993457) and next prime (196993481).
It can be written as a sum of positive squares in only one way, i.e., 145684900 + 51308569 = 12070^2 + 7163^2 .
It is a cyclic number.
It is not a de Polignac number, because 196993469 - 24 = 196993453 is a prime.
It is a super-2 number, since 2×1969934692 = 77612853657307922, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (196993409) 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, 98496734 + 98496735.
It is an arithmetic number, because the mean of its divisors is an integer number (98496735).
Almost surely, 2196993469 is an apocalyptic number.
It is an amenable number.
196993469 is a deficient number, since it is larger than the sum of its proper divisors (1).
196993469 is an equidigital number, since it uses as much as digits as its factorization.
196993469 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2834352, while the sum is 56.
The square root of 196993469 is about 14035.4361884482. The cubic root of 196993469 is about 581.8583566297.
The spelling of 196993469 in words is "one hundred ninety-six million, nine hundred ninety-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •