16115
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 5053
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11680
- Möbius Function
- -1
- Radical
- 16115
- 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
- 128
- 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
- Numerators of continued fraction convergents to sqrt(192).at n=6A041356
- Expansion of 1/sqrt(1 - 2*x + 5*x^2).at n=16A098331
- a(1) = 0, a(2) = 4, a(n) = a(n-1) + a(n-2) - 1.at n=20A187890
- Number of nX3 (0,1,2) arrays of permanents of 2X2 subblocks of some (n+1)X4 binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=5A227022
- T(n,k)=Number of nXk (0,1,2) arrays of permanents of 2X2 subblocks of some (n+1)X(k+1) binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=30A227025
- T(n,k)=Number of nXk (0,1,2) arrays of permanents of 2X2 subblocks of some (n+1)X(k+1) binary array with rows and columns of the latter in lexicographically nondecreasing order.at n=33A227025
- Number of partitions p of n such that (maximal multiplicity of the parts of p) < (number of distinct parts of p).at n=40A240305
- Number of periodic necklaces with n beads of 3 colors.at n=33A278663
- Square array A(m,n) (m>=1, n>=1) read by antidiagonals: A(m,n) = (2*n - 1)^^m mod (2*n)^m (see Comments for definition of ^^).at n=39A324017
- Sum of the seventh largest parts in the partitions of n into 9 parts.at n=45A326467
- Expansion of sqrt((1-5*x+sqrt(1-6*x+25*x^2)) / (2 * (1-6*x+25*x^2))).at n=8A337393
- Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of sqrt((1-(k+4)*x+sqrt(1+2*(k-4)*x+((k+4)*x)^2)) / (2 * (1+2*(k-4)*x+((k+4)*x)^2))).at n=53A337419
- Number of partitions of the n-th n-gonal pyramidal number into n-gonal pyramidal numbers.at n=9A337797
- Numbers k such that A360327(k) = A360327(k+1) > 1.at n=2A360358
- Number of multisets of positive integers whose right half (exclusive) sums to n.at n=24A360673
- Expansion of (1/x) * Series_Reversion( x / (1-x)^2 * (1-x-x^2)^3 ).at n=7A369488