Base | Representation |
---|---|
bin | 10111010111001… |
… | …10101011000001 |
3 | 111122202210222101 |
4 | 23223212223001 |
5 | 400132324334 |
6 | 31240310401 |
7 | 4566542113 |
oct | 1353465301 |
9 | 448683871 |
10 | 195979969 |
11 | a0697719 |
12 | 55772401 |
13 | 317aa5a3 |
14 | 1c0573b3 |
15 | 12313214 |
hex | bae6ac1 |
195979969 has 4 divisors (see below), whose sum is σ = 196416900. Its totient is φ = 195543040.
The previous prime is 195979967. The next prime is 195979997. The reversal of 195979969 is 969979591.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 136890000 + 59089969 = 11700^2 + 7687^2 .
It is a cyclic number.
It is not a de Polignac number, because 195979969 - 21 = 195979967 is a prime.
It is a super-2 number, since 2×1959799692 = 76816296498481922, which contains 22 as substring.
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 195979969.
It is not an unprimeable number, because it can be changed into a prime (195979963) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 217792 + ... + 218689.
It is an arithmetic number, because the mean of its divisors is an integer number (49104225).
Almost surely, 2195979969 is an apocalyptic number.
It is an amenable number.
195979969 is a deficient number, since it is larger than the sum of its proper divisors (436931).
195979969 is an equidigital number, since it uses as much as digits as its factorization.
195979969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436930.
The product of its digits is 12400290, while the sum is 64.
The square root of 195979969 is about 13999.2845888638. The cubic root of 195979969 is about 580.8587842831.
The spelling of 195979969 in words is "one hundred ninety-five million, nine hundred seventy-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •