14477
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14976
- Proper Divisor Sum (Aliquot Sum)
- 499
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13980
- Möbius Function
- 1
- Radical
- 14477
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 58
- 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
- a(n) = Sum_{k=0..n} T(n,k), T given by A026725.at n=13A026732
- Number of ways of numbering the vertices of a cube so sum of the 8 numbers is n.at n=17A039959
- Number of self-avoiding walks on square lattice trapped after n steps.at n=9A077482
- Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.at n=6A080047
- AbsoluteValue(Numerator(Bernoulli(2n))) mod denominator(Bernoulli(2n)).at n=24A180315
- AbsoluteValue(Numerator(Bernoulli(4n))) - Numerator(Bernoulli(4n)) mod denominator(Bernoulli(4n)) divided by two.at n=12A180320
- Number of arrangements of n+1 numbers x(i) in -6..6 with the sum of x(i)*x(i+1) equal to zero.at n=3A188355
- T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=39A188358
- Number of arrangements of 5 numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=5A188360
- Number of partitions of n such that (greatest part) + (least part) = number of parts.at n=52A237869
- Numbers n such that n = concatenate(a, b) and sigma(a) + sigma(b) = sigma(n) - n.at n=6A239562
- Number of inseparable partitions of n; see Comments.at n=42A325535