Base | Representation |
---|---|
bin | 10111010110110… |
… | …01110101100101 |
3 | 111122200010212021 |
4 | 23223121311211 |
5 | 400124134042 |
6 | 31235223141 |
7 | 4566232621 |
oct | 1353316545 |
9 | 448603767 |
10 | 195927397 |
11 | a0661176 |
12 | 55747ab1 |
13 | 3178c693 |
14 | 1c042181 |
15 | 12302867 |
hex | bad9d65 |
195927397 has 16 divisors (see below), whose sum is σ = 213346224. Its totient is φ = 179200000.
The previous prime is 195927383. The next prime is 195927427. The reversal of 195927397 is 793729591.
It can be written as a sum of positive squares in 8 ways, for example, as 31292836 + 164634561 = 5594^2 + 12831^2 .
It is a cyclic number.
It is not a de Polignac number, because 195927397 - 211 = 195925349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195927367) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 279147 + ... + 279847.
It is an arithmetic number, because the mean of its divisors is an integer number (13334139).
Almost surely, 2195927397 is an apocalyptic number.
195927397 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
195927397 is a deficient number, since it is larger than the sum of its proper divisors (17418827).
195927397 is a wasteful number, since it uses less digits than its factorization.
195927397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1160.
The product of its digits is 1071630, while the sum is 52.
The square root of 195927397 is about 13997.4067955461. The cubic root of 195927397 is about 580.8068408130.
The spelling of 195927397 in words is "one hundred ninety-five million, nine hundred twenty-seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •