16235
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 4501
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12160
- Möbius Function
- -1
- Radical
- 16235
- 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
- 66
- 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
- Gives an LCD representation of n.at n=26A071843
- Positive integers i for which A112049(i) == 8.at n=14A112068
- a(n)=2a(n-1)+a(n-2)-4a(n-4).at n=14A134270
- a(n) = 36*n^2 - 55*n + 21.at n=21A157262
- Number of (w,x,y,z) with all terms in {1,...,n} and 2w=x+y+z.at n=34A212068
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays x(i,j) with row sums sum{j*x(i,j), j=1..k+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..n+1} nondecreasing.at n=28A233049
- Number of (1+1)X(n+1) 0..2 arrays x(i,j) with row sums sum{j*x(i,j), j=1..n+1} nondecreasing, and column sums sum{i^2*x(i,j), i=1..1+1} nondecreasing.at n=7A233050
- Integers n such that either 2^n * prime(n) + 3 or 2^n * prime(n) - 3 is prime.at n=54A265126
- Halogen sequence: a(n) = A018227(n)-1.at n=43A271999
- a(n) is the number of permutations of length n that avoid the pattern 321 and the mesh pattern (12, 273).at n=10A289603
- Setwise difference A340150 \ A340076.at n=36A340151
- a(n) = Sum_{k=0..n} k*A349976(n, k).at n=11A349973
- Numbers k such that one can make an equilateral triangle from a chain of linked rods of length 1, 2, 3, ..., k, with perimeter equal to the total length.at n=24A382632
- Number of one-sided polyquarcs with n cells.at n=8A392393