16398
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 35568
- Proper Divisor Sum (Aliquot Sum)
- 19170
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5460
- Möbius Function
- 0
- Radical
- 5466
- Omega Function (Ω)
- 4
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = 2^n + n.at n=14A006127
- Expansion of Product_{m>=1} (1 - m*q^m)^6.at n=16A022666
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=34A024686
- Partial sums of A000337(n+4), n >= 0.at n=9A045618
- a(n) = 529*n - 1.at n=30A158365
- Where powers of 2 occur in the union of squares and powers of 2.at n=28A188917
- Number of 4X2 integer matrices with each row summing to zero, row elements in nondecreasing order, rows in lexicographically nondecreasing order, and the sum of squares of the elements <= 2*n^2 (number of collections of 4 zero-sum 2-vectors with total modulus squared not more than 2*n^2, ignoring vector and component permutations).at n=30A192703
- 1/4 the number of (n+1) X 8 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=26A209726
- Rectangular array: (row n) = b**c, where b(h) = -1 + 2^h, c(h) = b(n-1+h), n>=1, h>=1, and ** = convolution.at n=45A213747
- Number of (n+1) X (3+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nonincreasing x(i,j)-x(i-1,j) in the j direction.at n=12A250737
- Permutation of natural numbers: a(1) = 0, after which, a(2n) = A087686(1+a(n)), a(2n+1) = A088359(a(A268674(2n+1))).at n=46A269852
- G.f. satisfies: A(x) = Sum_{n>=0} x^n / (1 - (n+1)*x*A(x)^2).at n=6A316367
- Numbers k such that w(k), w(k+1), and w(k+2) are all odd, where w is A336957.at n=6A337644
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^(gcd(k, n) - 1).at n=7A342544