16395
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26256
- Proper Divisor Sum (Aliquot Sum)
- 9861
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8736
- Möbius Function
- -1
- Radical
- 16395
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 115
- Smith Number
- no
- Vampire 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
Appears in sequences
- Inverse binomial transform of A083590.at n=7A083592
- E.g.f.: A(x) = Sum_{n>=0} exp(Fibonacci(n)*x) * x^n/n!.at n=8A135741
- Partial sums of A000051, starting at n=1.at n=12A145071
- a(n) = the smallest positive multiple of n with exactly n digits when written in binary.at n=14A162213
- Sum of divisors of cubes.at n=17A175926
- Inversion sets of finite permutations that have only 0's and 1's in their inversion vectors.at n=23A211364
- Minimal number (in decimal representation) with n nonprime substrings in base-4 representation (substrings with leading zeros are considered to be nonprime).at n=33A217104
- a(n) is the number of base-4 n-digit numbers requiring only binary digits in bases 3 and 4.at n=54A230360
- Numbers m such that m^2 divides 2^k - 1 for some k, 0 < k <= m.at n=9A246503
- a(n) = Sum_{m=0..floor((n-1)/2)} prime((n-m)(n-m-1)/2+m+1).at n=25A249490
- a(n) = 2^n + 11.at n=14A267615
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 374", based on the 5-celled von Neumann neighborhood.at n=33A271459
- a(n) = sum of the divisors of the product of the divisors of n.at n=17A280685
- Expansion of Product_{k>=0} 1/(1-x^(5*k+4))^(5*k+4).at n=41A285132
- Number of ways to choose a constant rooted partition of each part in a constant rooted partition of n.at n=49A301763
- Numbers m such that m^2+1 is semiprime with (m-1)^2+1 and (m+1)^2+1 primes.at n=32A321985
- G.f.: Sum_{k>=1} (k^2 * x^(k^2) / Product_{j=1..k} (1 - x^j)).at n=48A333141
- Numbers k such that the ring of integers of Q(2^(1/k)) is not Z[2^(1/k)].at n=18A342390
- a(n) is the smallest number that is the sum of n positive 6th powers in two ways.at n=12A343079
- a(1) = 1; a(n) = Sum_{d|n, d < n} binomial(n,d) * a(d).at n=14A345136