16276
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30772
- Proper Divisor Sum (Aliquot Sum)
- 14496
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 0
- Radical
- 8138
- 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
- 159
- 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
- Number of 5-ary search trees on n keys.at n=14A019499
- Numbers k such that k^2 is palindromic in base 5.at n=19A029988
- Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,0.at n=6A033115
- Sums of 4 distinct powers of 5.at n=20A038476
- Numbers whose base-5 representation has exactly 7 runs.at n=0A043607
- Least k such that the longest palindromic substring (without leading zeros) contained in 2^k has length n.at n=17A052059
- a(n) = n^3 + n^2 + n + 1.at n=25A053698
- Binomial transform of A000013.at n=11A054196
- a(n) = n^6 + n^4 + n^2 + 1.at n=5A059830
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.at n=25A064687
- Numbers of the form (5^{mr}-1)/(5^r-1) for positive integers m, r.at n=13A076284
- a(n)=(-1)^(n+1)*(5/4)*(25^n-1)*B(2n) where B(k) denotes the k-th Bernoulli number.at n=4A090644
- Modulo 2 binomial transform of 5^n.at n=6A100308
- Number of partitions of n into parts but with two kinds of parts of sizes 1 to 8.at n=19A103927
- Integers k such that 10^k + 67 is a prime number.at n=16A135113
- a(n) = 13*n^2 + 10*n + 1.at n=35A161587
- a(n) = 9 a (n-1)-26 a(n-2) +24 a(n-3) (n >= 3) with a(0) =a(1)=1, a(2)=2.at n=7A162723
- Triangle T(n, k, q) = q-binomial(n, k, q^2), for q = 5, read by rows.at n=11A173583
- Triangle T(n, k, q) = q-binomial(n, k, q^2), for q = 5, read by rows.at n=13A173583
- T(n,k) = (k^n)*U(n, (1/k + k)/2), where U(n,x) is the n-th Chebyshev polynomial of the second kind, square array read by antidiagonals upward (n >= 0, k >= 1).at n=32A173588