14253
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 19008
- Proper Divisor Sum (Aliquot Sum)
- 4755
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9500
- Möbius Function
- 1
- Radical
- 14253
- 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
- 164
- 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
- Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).at n=13A023065
- Number of ternary codes of length 3 with n words.at n=12A034215
- Number of ternary codes of length 3 with n words.at n=15A034215
- Number of ternary codes (not necessarily linear) of length n with 12 words.at n=2A034232
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 16.at n=35A050965
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=39A097240
- Octanacci numbers.at n=19A123526
- Permutations of 12345: Numbers having each of the decimal digits 1,...,5 exactly once, and no other digit.at n=13A178475
- Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value.at n=16A200764
- Number of n X n 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207494
- Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207497
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=40A207500
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.at n=4A207502
- a(n) = Sum of (Y(2,p)^2) over the partitions p of n, Y(2,p) = number of part sizes with multiplicity 2 or greater in p.at n=28A302347
- Number of compositions (ordered partitions) of the n-th triangular number into distinct triangular numbers.at n=16A331900
- Expansion of (-1 + Product_{k>=1} 1 / (1 - x^k))^3.at n=11A341221
- Numbers k such that k, k + 1, k + 2, and k + 4 are all semiprimes.at n=41A368670