14289
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 6543
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8640
- Möbius Function
- -1
- Radical
- 14289
- Omega Function (Ω)
- 3
- 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
- 32
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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) = a(n-1) + 2*a(n-3).at n=18A003476
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| <= 1 for i = 1,2,...,n, s(0) = 2, s(n) = 5. Also a(n) = T(n,n-3), where T is the array in A026323.at n=8A026328
- Numbers k such that sigma(k-phi(k)) = phi(k).at n=11A070170
- Numbers k such that (2^k - 1)^2 - 2 = 4^k - 2^(k+1) - 1 is prime.at n=29A091515
- Number of coverings of {1...n} by translation of a single set.at n=14A096202
- Smallest number m such that A114228(m) = n.at n=45A114229
- Numbers for which the sum of the digits is the square root of the product of their digits.at n=31A117720
- Generalized central binomial coefficients for k=2.at n=9A121724
- 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, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=8A149550
- Exactly one of (2^n-1)^2-2 and (2^n+1)^2-2 is prime.at n=53A173888
- Square array A(n,k) by antidiagonals. A(n,k) is the number of length 2n k-ary words (n,k>=0), either empty or beginning with the first character of the alphabet, that can be built by repeatedly inserting doublets into the initially empty word.at n=60A183134
- Number of n-ary words beginning with the first character of the alphabet, that can be built by inserting five doublets into the initially empty word.at n=5A194717
- Number of 5-ary words either empty or beginning with the first character of the alphabet, that can be built by inserting n doublets into the initially empty word.at n=5A194725
- Number of 2n-length words, either empty or beginning with the first character of an n-ary alphabet, that can be built by repeatedly inserting doublets into the initially empty word.at n=5A248828
- 29-gonal numbers: a(n) = n*(27*n-25)/2.at n=33A255187
- Number of partitions of n into two sorts of parts having exactly 10 parts of the second sort.at n=6A258480
- Number T(n,k) of n X n Tesler matrices of nonnegative integers with element sum n+k; triangle T(n,k), n>=1, 0<=k<=n*(n-1)/2, read by rows.at n=50A259786
- Number of squares in the interval [e^(n-1), e^n).at n=21A306486
- Expansion of Product_{i>=1, j>=1} (1 + x^(i*j) + x^(2*i*j)).at n=22A329805
- Irregular triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} with cycle descent number equal to k.at n=25A349106