Base | Representation |
---|---|
bin | 10111010001101… |
… | …10111111101101 |
3 | 111121102020220120 |
4 | 23220312333231 |
5 | 344441313042 |
6 | 31213035153 |
7 | 4560454203 |
oct | 1350667755 |
9 | 447366816 |
10 | 195260397 |
11 | a0246032 |
12 | 55485ab9 |
13 | 315b7bc7 |
14 | 1bd0b073 |
15 | 1221edec |
hex | ba36fed |
195260397 has 8 divisors (see below), whose sum is σ = 274049760. Its totient is φ = 123322320.
The previous prime is 195260383. The next prime is 195260411. The reversal of 195260397 is 793062591.
It is an interprime number because it is at equal distance from previous prime (195260383) and next prime (195260411).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 195260397 - 24 = 195260381 is a prime.
It is a super-3 number, since 3×1952603973 (a number of 26 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195260297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1712754 + ... + 1712867.
It is an arithmetic number, because the mean of its divisors is an integer number (34256220).
Almost surely, 2195260397 is an apocalyptic number.
It is an amenable number.
195260397 is a deficient number, since it is larger than the sum of its proper divisors (78789363).
195260397 is a wasteful number, since it uses less digits than its factorization.
195260397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3425643.
The product of its (nonzero) digits is 102060, while the sum is 42.
The square root of 195260397 is about 13973.5606414400. The cubic root of 195260397 is about 580.1470069299.
The spelling of 195260397 in words is "one hundred ninety-five million, two hundred sixty thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •