Base | Representation |
---|---|
bin | 1011011100001001001… |
… | …1110101101110110001 |
3 | 200210021202110200212101 |
4 | 2313002103311232301 |
5 | 11210000034242131 |
6 | 230141455100401 |
7 | 20125166156242 |
oct | 2670223655661 |
9 | 623252420771 |
10 | 196533509041 |
11 | 76393051241 |
12 | 3210a811701 |
13 | 156c10b5aac |
14 | 9725966cc9 |
15 | 51a3e85c61 |
hex | 2dc24f5bb1 |
196533509041 has 9 divisors (see below), whose sum is σ = 197643137601. Its totient is φ = 195430083072.
The previous prime is 196533508991. The next prime is 196533509047. The reversal of 196533509041 is 140905335691.
The square root of 196533509041 is 443321.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 17232075441 + 179301433600 = 131271^2 + 423440^2 .
It is a de Polignac number, because none of the positive numbers 2k-196533509041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 196533508982 and 196533509000.
It is not an unprimeable number, because it can be changed into a prime (196533509047) 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, 85559805 + ... + 85562101.
Almost surely, 2196533509041 is an apocalyptic number.
196533509041 is the 443321-st square number.
196533509041 is the 221661-st centered octagonal number.
It is an amenable number.
196533509041 is a deficient number, since it is larger than the sum of its proper divisors (1109628560).
196533509041 is an frugal number, since it uses more digits than its factorization.
196533509041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4980 (or 2490 counting only the distinct ones).
The product of its (nonzero) digits is 437400, while the sum is 46.
The spelling of 196533509041 in words is "one hundred ninety-six billion, five hundred thirty-three million, five hundred nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •