14234
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 23328
- Proper Divisor Sum (Aliquot Sum)
- 9094
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6460
- Möbius Function
- -1
- Radical
- 14234
- Omega Function (Ω)
- 3
- 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
- 151
- 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
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=44A004006
- Numbers k such that 60*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=28A056657
- Number of rooted identity trees on n nodes with thinning limbs.at n=19A124346
- Number of partitions p of n such that (number of even numbers in p) = (number of odd numbers in p).at n=43A241638
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 22", based on the 5-celled von Neumann neighborhood.at n=42A269717
- Maximum starting value of X such that repeated replacement of X with X-ceiling(X/6) requires n steps to reach 0.at n=46A279076
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=45A295865
- The number of permutations of length n and tier at most 1, that is, the number of permutations of length n sortable by two passes through a stack where outputting the longest prefix matching the identity permutation is prioritized.at n=8A308726
- Numbers k such that phi(k) < phi(k+1) < phi(k+2) < phi(k+3) where phi is the Euler totient function (A000010).at n=32A327880
- Maximal coefficient of (1 + x^2) * (1 + x^3) * (1 + x^4) * ... * (1 + x^n).at n=21A369706
- Number of growing self-avoiding walks with displacement n on a half-infinite strip of height 4 with a trapped endpoint.at n=4A374300