Base | Representation |
---|---|
bin | 1011011011100011100… |
… | …1111010101000110001 |
3 | 200202212202120002212101 |
4 | 2312320321322220301 |
5 | 11204134140442244 |
6 | 230114101100401 |
7 | 20121242031331 |
oct | 2667071725061 |
9 | 622782502771 |
10 | 196375718449 |
11 | 76311a78899 |
12 | 320859b7701 |
13 | 156974b9b91 |
14 | 970ca110c1 |
15 | 51951b80d4 |
hex | 2db8e7aa31 |
196375718449 has 9 divisors (see below), whose sum is σ = 196990502059. Its totient is φ = 195762851680.
The previous prime is 196375718437. The next prime is 196375718459. The reversal of 196375718449 is 944817573691.
The square root of 196375718449 is 443143.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 34449958449 + 161925760000 = 185607^2 + 402400^2 .
It is not a de Polignac number, because 196375718449 - 219 = 196375194161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (196375718459) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 222900489 + ... + 222901369.
Almost surely, 2196375718449 is an apocalyptic number.
196375718449 is the 443143-rd square number.
196375718449 is the 221572-nd centered octagonal number.
It is an amenable number.
196375718449 is a deficient number, since it is larger than the sum of its proper divisors (614783610).
196375718449 is an frugal number, since it uses more digits than its factorization.
196375718449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2768 (or 1384 counting only the distinct ones).
The product of its digits is 45722880, while the sum is 64.
Multiplying 196375718449 by its sum of digits (64), we get a square (12568045980736 = 35451442).
The spelling of 196375718449 in words is "one hundred ninety-six billion, three hundred seventy-five million, seven hundred eighteen thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •