14700
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 54
- Divisor Sum
- 49476
- Proper Divisor Sum (Aliquot Sum)
- 34776
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 210
- 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
- 102
- 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 n-step self-avoiding walks on f.c.c. lattice.at n=4A001336
- Number of sensed planar maps with n edges and without faces of degree 1.at n=8A006388
- Number of labeled disconnected trivalent (or cubic) graphs with 2n nodes.at n=5A007102
- Orders of non-cyclic simple groups (divided by 4).at n=26A008976
- Coordination sequence for MgNi2, Position Ni3.at n=30A009934
- a(n) = floor( n*(n-1)*(n-2)/8 ).at n=50A011890
- Aliquot sequence starting at 660.at n=25A014362
- Number of lines through exactly 4 points of an n X n grid of points.at n=37A018811
- Place n distinguishable balls in n boxes (in n^n ways); let T(n,k) = number of ways that the maximum in any box is k, for 1 <= k <= n; sequence gives triangle of numbers T(n,k).at n=17A019575
- a(n) = Sum_{k=0..n-3} T(n,k) * T(n,k+3), with T given by A026386.at n=5A026954
- a(n) = 49*(n-1)*(n-2)/2.at n=23A027469
- Cube of the lower triangular normalized partition matrix.at n=20A027517
- First diagonal of A027517.at n=5A027522
- Words over signatures (derived from multisets and multinomials).at n=40A035796
- a(n) = n^2*(n^2 + 1)*(n-1).at n=7A037250
- Row 3 of array in A047666.at n=27A047667
- Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.at n=36A049009
- a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.at n=24A059270
- Numbers k such that sigma(x) = k has exactly 8 solutions.at n=38A060664
- Triangle read by rows, T(n, k) = binomial(n, k)*binomial(n + 2, k).at n=40A062196