16269
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
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 9651
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8960
- Möbius Function
- 1
- Radical
- 16269
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 115
- Smith Number
- yes
- 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
- Octahedral numbers: a(n) = n*(2*n^2 + 1)/3.at n=29A005900
- Terms of A050530 with four prime divisors.at n=7A053340
- a(n) = (2*n - 1)*(8*n^2 - 8*n + 3)/3.at n=14A063496
- Number of potential flows in n X n array with integer velocities in -14..14, i.e., number of n X n arrays with adjacent elements differing by no more than 14, counting arrays differing by a constant only once.at n=1A068761
- Partial sums of A053872.at n=12A155974
- a(n) = 100*n^2 - 49*n + 6.at n=12A157651
- Numbers k such that k and k+17 have same sum of divisors.at n=8A172335
- Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000011.at n=7A259719
- A close cousin of A222311 (see Cobeli et al. 2015 for precise definition).at n=29A275914
- Squarefree composite numbers n such that b^n == b (mod gpf(n)) for every integer b, where gpf(n) = A006530(n).at n=35A276832
- Partial sums of the odd triangular numbers (A014493).at n=28A352116