14852
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 26880
- Proper Divisor Sum (Aliquot Sum)
- 12028
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7176
- Möbius Function
- 0
- Radical
- 7426
- 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
- 71
- 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
- Coordination sequence for MgCu2, Cu position.at n=30A009930
- Conjectured formula for irreducible 5-fold Euler sums of weight 2n+13.at n=44A019450
- Numbers whose set of base-9 digits is {2,3}.at n=36A032809
- Multiplicity of highest weight (or singular) vectors associated with character chi_127 of Monster module.at n=40A034515
- Number of nondividing sets on {1,2,...,n}.at n=37A051014
- Nearest integer to n^5/25.at n=12A061003
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=43A064283
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=43A095234
- a(n) = Sum_{k=0..floor(n/6)} C(n-3k,3k) * 2^(n-5k).at n=12A100138
- Conjectured positive numbers which have more than one representation (m,s) as a difference s^2 - m^5, m >= 1, s > 0.at n=31A177770
- Symmetric triangle T, read by rows, where the matrix product of T and T transpose yields a square array which, when read by antidiagonals, equals this triangle read by rows.at n=45A194949
- Symmetric triangle T, read by rows, where the matrix product of T and T transpose yields a square array which, when read by antidiagonals, equals this triangle read by rows.at n=54A194949
- Column 0 of triangle A194949 = shifted row sums of triangle A194949.at n=9A194950
- Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 6).at n=27A212365
- n * Lucas(n) - (n - 1) * Lucas(n - 1).at n=15A246715
- Number of length 4+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=8A247536
- Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=4A264543
- Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=4A264547
- T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=40A264550
- Number of (5+1)X(n+1) arrays of permutations of 0..n*6+5 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=4A264554