195
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 336
- Proper Divisor Sum (Aliquot Sum)
- 141
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 96
- Möbius Function
- -1
- Radical
- 195
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 119
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertfünfundneunzig· ordinal: einshundertfünfundneunzigste
- English
- one hundred ninety-five· ordinal: one hundred ninety-fifth
- Spanish
- ciento noventa y cinco· ordinal: 195º
- French
- cent quatre-vingt-quinze· ordinal: cent quatre-vingt-quinzième
- Italian
- centonovantacinque· ordinal: 195º
- Latin
- centum nonaginta quinque· ordinal: 195.
- Portuguese
- cento e noventa e cinco· ordinal: 195º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=40A000008
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=11A000070
- a(n) = 4*n^2 - 1.at n=7A000466
- Number of interval orders constructed from n intervals of generic lengths.at n=3A000763
- Number of twin prime pairs < square of n-th prime.at n=24A000885
- Lucky numbers.at n=38A000959
- Numbers that are divisible by at least three different primes.at n=29A000977
- Dimensions (sorted, with duplicates removed) of real simple Lie algebras.at n=46A001066
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=16A001101
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=43A001195
- Double-bitters: only even length runs in binary expansion.at n=9A001196
- If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2.at n=12A001224
- Lerch's function q_2(n) = (2^{phi(t)} - 1)/t where t = 2*n - 1.at n=10A001226
- Numbers of form m*k with m+1 <= k <= 2m-1.at n=54A001284
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=40A001312
- Number of n-celled polyominoes with holes.at n=9A001419
- a(n) = (4*n+1)*(4*n+3).at n=3A001539
- Related to Gilbreath conjecture.at n=13A001549
- Nearest integer to 2*n*log(n).at n=29A001618
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=9A001682