14481
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 20930
- Proper Divisor Sum (Aliquot Sum)
- 6449
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9648
- Möbius Function
- 0
- Radical
- 4827
- Omega Function (Ω)
- 3
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/((1-x)*(1-2*x)*(1-5*x)*(1-8*x)).at n=4A021129
- a(n) = floor(A058303*(2^(n-2)+1/2)).at n=11A094393
- A version of F. K. Hwang's sequence in {3*k, 3*k+1, 3*k+2}.at n=37A123945
- 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, 1), (-1, 1, -1), (0, 0, 1), (0, 1, 1), (1, 0, -1)}.at n=8A150040
- Number of 0..n arrays x(0..7) of 8 elements with zero 4th differences.at n=39A200331
- G.f.: exp( Sum_{n>=1} x^n/n * Sum_{k=0..n} binomial(n,k) * binomial(n^2,k^2) ).at n=4A207139
- Number of partitions of n such that (least part) < (multiplicity of greatest part).at n=46A240178
- Numbers k such that the smallest k-digit odd number concatenated with the largest k-digit odd number is prime.at n=6A247182
- Numbers k such that (13*10^k - 61)/3 is prime.at n=20A291201
- Number of separable partitions of n in which the number of distinct (repeatable) parts is > 3.at n=36A325718
- Number of primes less than 10^n with digits in nondecreasing order.at n=11A345325
- Number of partitions of n such that 4*(smallest part) = (number of parts).at n=61A350896