Base | Representation |
---|---|
bin | 10111010000100… |
… | …00111000000101 |
3 | 111121010022201202 |
4 | 23220100320011 |
5 | 344421314021 |
6 | 31205432245 |
7 | 4556234042 |
oct | 1350207005 |
9 | 447108652 |
10 | 195104261 |
11 | a01497a0 |
12 | 5540b685 |
13 | 31561b11 |
14 | 1bcaa1c9 |
15 | 121dda0b |
hex | ba10e05 |
195104261 has 8 divisors (see below), whose sum is σ = 213798144. Its totient is φ = 176569920.
The previous prime is 195104249. The next prime is 195104267. The reversal of 195104261 is 162401591.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 195104261 - 26 = 195104197 is a prime.
It is a super-2 number, since 2×1951042612 = 76131345320712242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (195104267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37316 + ... + 42221.
It is an arithmetic number, because the mean of its divisors is an integer number (26724768).
Almost surely, 2195104261 is an apocalyptic number.
195104261 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
195104261 is a deficient number, since it is larger than the sum of its proper divisors (18693883).
195104261 is a wasteful number, since it uses less digits than its factorization.
195104261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79771.
The product of its (nonzero) digits is 2160, while the sum is 29.
The square root of 195104261 is about 13967.9726875449. The cubic root of 195104261 is about 579.9923314484.
The spelling of 195104261 in words is "one hundred ninety-five million, one hundred four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •