14269
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15040
- Proper Divisor Sum (Aliquot Sum)
- 771
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13500
- Möbius Function
- 1
- Radical
- 14269
- 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
- 195
- 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
- Numerators of continued fraction convergents to sqrt(347).at n=7A041656
- Non-palindromic n and its digit reversal have the same sum of prime factors (with repetition).at n=33A085607
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 110-111-010 pattern in any orientation.at n=13A146246
- a(n) = 8*n^2 + 20*n + 1.at n=41A161617
- Number of n element 0..3 arrays with each element the minimum of 4 adjacent elements of a random 0..3 array of n+3 elements.at n=9A217950
- Number of (n+1)X(1+1) 0..1 arrays x(i,j) with row sums sum{j^4*x(i,j), j=1..1+1} nondecreasing, and column sums sum{i^4*x(i,j), i=1..n+1} nondecreasing.at n=44A232790
- Number of structures of size n in class A = o x (o + MSET(A)) where o is a neutral structure of size 1.at n=12A237585
- Numbers n such that (4 * 6^n + 1)/5 is prime.at n=20A248613
- a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise differences of elements are distinct, and for 1<m<n, a(m) does not divide a(n).at n=57A256062
- Non-palindromic composite numbers such that n' = [Rev(n)]', where n' is the arithmetic derivative of n.at n=8A259077
- Unary-binary representation of Stern polynomials: a(n) = A156552(A260443(n)).at n=41A277020
- Odd bisection of A277020: a(n) = A277020(2n+1).at n=20A277189
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 726", based on the 5-celled von Neumann neighborhood.at n=13A283817
- Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.at n=37A293822
- Number of series-reduced rooted trees whose leaves form an integer partition of n with no 1's.at n=17A320296
- Numbers m such that A338038(m) = A338038(A004086(m)) where A004086(i) is i read backwards and A338038(i) is the sum of the primes and exponents in the prime factorization of i ignoring 1-exponents; palindromes and multiples of 10 are excluded.at n=27A338039
- Lexicographically earliest sequence of distinct positive integers such that the first digit of a(n) + a(n+1) is the n-th digit of the sequence.at n=65A352386
- a(1) = 1, a(2) = 2; for n >= 3, a(n) = (n-1)^3 - a(n-1) - a(n-2).at n=34A361134
- Numbers k such that primorial base expansion of A276086(k) has the primorial base expansion of A003415(k) as its suffix, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=19A383933