16368
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
- 4
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 47616
- Proper Divisor Sum (Aliquot Sum)
- 31248
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 2046
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- 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 - 2.at n=12A000247
- Unicursal (i.e., possessing an Eulerian path) planar rooted maps with n edges.at n=6A003584
- a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=12A004930
- a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=12A004950
- Numbers j such that sigma(sigma(j)) = k*j for some k.at n=27A019278
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,8)-perfect numbers.at n=4A019285
- a(n) = n*(n+1)*(n+2)/2.at n=31A027480
- a(n) = n*(2*n-1)*(2*n+1).at n=16A035328
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.at n=27A059828
- Integer part of square root of n-th Fibonacci number.at n=42A061287
- List of codewords in binary lexicode with Hamming distance 9 written as decimal numbers.at n=3A075943
- Triangle T(n,k) defined by the generating function cosh(sqrt(y)*arcsin(x)) + sqrt(y)*sinh(sqrt(y)*arcsin(x)) - 1 = Sum_{n>=1} Sum_{k=1..n} T(n,k)*y^k *x^n/n!.at n=39A091885
- G.f.: q*Product_{k>0} (1-q^(12k))(1+q^(12k-1))(1+q^(12k-11))/(1-q^k).at n=32A098693
- a(n) = 16*(8*prime(n) + 7).at n=30A098823
- a(n) = round(sqrt(Fibonacci(n))).at n=42A100665
- a(n) = 16*n*(n+2).at n=31A114444
- a(n) = 10*a(n-1) - 16*a(n-2), with a(0) = 0 and a(1) = 3.at n=5A120689
- Coefficients of a q-series inspired by Andrews and Ramanujan.at n=33A122928
- Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=8.at n=29A135193
- a(n) = n*(n^2 - 1)/2.at n=32A135503