14380
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 15860
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5744
- Möbius Function
- 0
- Radical
- 7190
- 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
- 71
- 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
- yes
- Odd
- no
Appears in sequences
- Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n edges.at n=13A010355
- Numbers k whose decimal representation, read as a base-18 value and divided by k, yields an integer.at n=27A032567
- Number of permutations (p(1),p(2),...,p(n)) of (1,2,...,n) such that p(i)-i is in {-2,-1,3} for all i=1,...,n.at n=34A079999
- Number of partitions of n such that largest part k occurs at most floor(k/2) times.at n=34A118084
- a(1)=a(2)=1; a(n) = a(n-2) + a(n-1) + (number of terms from among {a(1), a(2), ..., a(n-1)} which are prime).at n=19A128609
- a(n) = 36*n^2 - n.at n=19A157286
- a(n) = 144*n^2 - 2*n.at n=9A158135
- a(n) = 400*n^2 - 20.at n=5A158597
- Numbers n such that n*2^1279 - 1 is prime.at n=39A265502
- Smallest numbers leading in n steps to a term that repeats itself, according to the rule explained in A316650 (and hereunder in the Comment section).at n=46A316678
- Indices of primes followed by a gap (distance to next larger prime) of 38.at n=42A320717
- Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs and a global source, n >= 1, k = 0..n*(n-1)/2.at n=56A350488
- Numbers k such that the odd part of sigma(sigma(k)) is equal to the odd part of sigma(k).at n=47A353365
- a(n) = n! * Sum_{k=1..n} Sum_{d|k} 1/(d! * (k/d)!).at n=6A356004