14030
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 26784
- Proper Divisor Sum (Aliquot Sum)
- 12754
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 14030
- 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
- 182
- Smith Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci sequence beginning 0, 23.at n=15A022357
- a(n) = floor(sqrt(phi(w)*sigma(w)+w^2)), where w=10^n.at n=3A065550
- Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals.at n=30A098697
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, 0, 0), (1, 1, -1), (1, 1, 1)}.at n=7A150827
- 5 times centered pentagonal numbers: 5*(5*n^2 + 5*n + 2)/2.at n=33A164015
- Number of 3-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=30A187298
- Number of n X n 0..5 matrices whose square is also a 0..5 matrix.at n=2A213987
- T(n,k)=Number of n X n 0..k matrices whose square is also a 0..k matrix.at n=23A213990
- Number of 3X3 0..n matrices whose square is also a 0..n matrix.at n=4A213992
- Number of partitions p of n containing ceiling((min(p) + max(p))/2) as a part.at n=40A238484
- Number of length 3 1..(n+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=38A254220
- Number of length-(n+1) 0..3 arrays with new values introduced in sequential order, and with new repeated values introduced in sequential order, both starting with zero.at n=8A268322
- T(n,k)=Number of length-(n+1) 0..k arrays with new values introduced in sequential order, and with new repeated values introduced in sequential order, both starting with zero.at n=63A268327
- Number of n-node rooted trees in which three equals the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root.at n=11A318899