Base | Representation |
---|---|
bin | 10111010100100… |
… | …11100100111101 |
3 | 111122010112002121 |
4 | 23222103210331 |
5 | 400040431423 |
6 | 31225122541 |
7 | 4563623611 |
oct | 1352234475 |
9 | 448115077 |
10 | 195639613 |
11 | a0484a34 |
12 | 55629451 |
13 | 316bb6b0 |
14 | 1bda9341 |
15 | 1229745d |
hex | ba9393d |
195639613 has 8 divisors (see below), whose sum is σ = 210875000. Its totient is φ = 180430848.
The previous prime is 195639611. The next prime is 195639617. The reversal of 195639613 is 316936591.
It can be written as a sum of positive squares in 4 ways, for example, as 11847364 + 183792249 = 3442^2 + 13557^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 195639613 - 21 = 195639611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 195639613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195639611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10213 + ... + 22261.
It is an arithmetic number, because the mean of its divisors is an integer number (26359375).
Almost surely, 2195639613 is an apocalyptic number.
195639613 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
195639613 is a deficient number, since it is larger than the sum of its proper divisors (15235387).
195639613 is a wasteful number, since it uses less digits than its factorization.
195639613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13311.
The product of its digits is 131220, while the sum is 43.
The square root of 195639613 is about 13987.1231137786. The cubic root of 195639613 is about 580.5223326703.
The spelling of 195639613 in words is "one hundred ninety-five million, six hundred thirty-nine thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •