14101
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14400
- Proper Divisor Sum (Aliquot Sum)
- 299
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13804
- Möbius Function
- 1
- Radical
- 14101
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Cubes written in base 6.at n=12A004636
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 76 ones.at n=16A031844
- Sequence A085188 shown in factorial base. (The longest prefix which can be shown with digits < 10.)at n=40A085187
- Given the infinite continued fraction (1+i)+((1+i)/(1+i)+((1+i)/((1+i)+...)))), where i is the square root of (-1), this is the numerator of the imaginary part of the convergents.at n=11A093726
- 4-Smith numbers.at n=15A103125
- Centered 47-gonal numbers.at n=24A129428
- 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, 0, 1), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 1, 1)}.at n=7A150873
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=16A153656
- Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (2*j +3)*prime(j)*T(n-2, k-1) with j=9, read by rows.at n=19A153656
- a(n) is the smallest term m in A173978 for which A020639(2m-3) = prime(n), n > 1.at n=36A173980
- Number of (n+1) X 5 0..3 arrays with every 2 X 2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor.at n=7A206339
- Composite numbers coprime to 6 such that A179382(n) = A000265(n-1), the odd part of n-1.at n=25A225913
- Odd numbers m that are neither of the form p + 2^k nor of the form p - 2^k with 2^k < m, k >= 1, and p prime.at n=16A255967
- Numbers whose sum of divisors is equal to the product of the number of divisors of their k first powers, for some k.at n=34A283758
- a(n) = n*(n + 5)*(n + 7)/6 + 1.at n=40A323221
- Setwise difference A340150 \ A340076.at n=32A340151
- Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 9, up to isomorphism.at n=41A358249