14237
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14880
- Proper Divisor Sum (Aliquot Sum)
- 643
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13596
- Möbius Function
- 1
- Radical
- 14237
- 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
- 50
- 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
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 20.at n=26A050969
- a(n) = (n^3 + 5*n + 18)/6.at n=46A060163
- 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, 0), (-1, 0, 0), (0, 1, -1), (1, -1, -1), (1, 1, 1)}.at n=8A149584
- Number of binary strings of length n with no substrings equal to 0000 or 0011.at n=16A164388
- a(n) = ceiling(A173497(n)/2).at n=32A173508
- Number of numerical semigroups of multiplicity n and genus n+2.at n=44A180739
- Number of sequences of n coin flips that win on the last flip, if the sequence of flips ends with (0,0,1,1).at n=19A199925
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 49", based on the 5-celled von Neumann neighborhood.at n=6A270015
- Number of nX5 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=5A297820
- Number of nX6 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=4A297821
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=49A297823
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 king-move adjacent elements, with upper left element zero.at n=50A297823
- MM-numbers of capturing, non-nesting multiset partitions (with empty parts allowed).at n=20A326260
- Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=12A346135