14085
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 24492
- Proper Divisor Sum (Aliquot Sum)
- 10407
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7488
- Möbius Function
- 0
- Radical
- 4695
- Omega Function (Ω)
- 4
- 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
- 107
- Smith Number
- yes
- 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
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=38A001976
- For any circular arrangement of 0..n-1, let S = sum of squares of every sum of two contiguous numbers; then a(n) = # of distinct values of S.at n=43A007773
- Numbers k such that k and 6*k are anagrams.at n=4A023090
- a(n) = T(n, n-2), where T is given by A026519. Also number of integer strings s(0), ..., s(n), counted by T, such that s(n) = 2.at n=11A026522
- a(n) = T(n, n-2), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 2.at n=11A026555
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=20A097155
- Expansion of 1/(1-x-x^4-x^6).at n=27A120446
- Last term where no prime sums occur in A161190 in a 4-diagonal set of 24 terms.at n=5A161193
- Number of partitions of n having no parts with multiplicity 8.at n=35A184643
- Number of nX3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,0,0 for x=0,1,2,3,4.at n=6A197532
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,1,0,0 for x=0,1,2,3,4.at n=2A197536
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,0,0 for x=0,1,2,3,4.at n=38A197537
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 2,0,1,0,0 for x=0,1,2,3,4.at n=42A197537
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y| not distinct.at n=38A213491
- Numbers x whose digits can be permuted to produce a multiple of x.at n=26A245680
- Irregular triangle read by rows: T(n,m) = number of lattice paths of type B^H terminating at point (n, m).at n=44A291085
- a(n) = (4*n^3 + 12*n^2 - 4*n + 3)/3.at n=21A322594
- Numbers m such that the proportion of nonsquarefree numbers in the interval [1, m] is greater than the corresponding proportion for all k > m.at n=32A336026