Base | Representation |
---|---|
bin | 1011010110100100001… |
… | …1111101010101001001 |
3 | 200122102101222011211201 |
4 | 2311221003331111021 |
5 | 11143413230024031 |
6 | 225333130024201 |
7 | 20043115060021 |
oct | 2655103752511 |
9 | 618371864751 |
10 | 195036173641 |
11 | 75794920a71 |
12 | 31971278061 |
13 | 15512b1760a |
14 | 9622b58a81 |
15 | 51177b5d61 |
hex | 2d690fd549 |
195036173641 has 9 divisors (see below), whose sum is σ = 195687089013. Its totient is φ = 194387420640.
The previous prime is 195036173597. The next prime is 195036173653. The reversal of 195036173641 is 146371630591.
The square root of 195036173641 is 441629.
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 11115274041 + 183920899600 = 105429^2 + 428860^2 .
It is not a de Polignac number, because 195036173641 - 213 = 195036165449 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 195036173591 and 195036173600.
It is not an unprimeable number, because it can be changed into a prime (195036173341) 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, 185925285 + ... + 185926333.
Almost surely, 2195036173641 is an apocalyptic number.
195036173641 is the 441629-th square number.
195036173641 is the 220815-th centered octagonal number.
It is an amenable number.
195036173641 is a deficient number, since it is larger than the sum of its proper divisors (650915372).
195036173641 is an frugal number, since it uses more digits than its factorization.
195036173641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2940 (or 1470 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 46.
The spelling of 195036173641 in words is "one hundred ninety-five billion, thirty-six million, one hundred seventy-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •