Base | Representation |
---|---|
bin | 1011011000101011111… |
… | …1011010001101000001 |
3 | 200200220002002012120021 |
4 | 2312022333122031001 |
5 | 11201044441002104 |
6 | 225505422413441 |
7 | 20063166344101 |
oct | 2661277321501 |
9 | 620802065507 |
10 | 195605406529 |
11 | 75a57175075 |
12 | 31aaba31281 |
13 | 155a3a30000 |
14 | 96785b3201 |
15 | 514c757754 |
hex | 2d8afda341 |
195605406529 has 15 divisors (see below), whose sum is σ = 211986289887. Its totient is φ = 180489842208.
The previous prime is 195605406527. The next prime is 195605406643. The reversal of 195605406529 is 925604506591.
The square root of 195605406529 is 442273.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 127145730625 + 68459675904 = 356575^2 + 261648^2 .
It is not a de Polignac number, because 195605406529 - 21 = 195605406527 is a prime.
It is a super-2 number, since 2×1956054065292 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (195605406527) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 74742829 + ... + 74745445.
Almost surely, 2195605406529 is an apocalyptic number.
195605406529 is the 442273-rd square number.
195605406529 is the 221137-th centered octagonal number.
It is an amenable number.
195605406529 is a deficient number, since it is larger than the sum of its proper divisors (16380883358).
195605406529 is an frugal number, since it uses more digits than its factorization.
195605406529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5286 (or 2630 counting only the distinct ones).
The product of its (nonzero) digits is 2916000, while the sum is 52.
The spelling of 195605406529 in words is "one hundred ninety-five billion, six hundred five million, four hundred six thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •