14391
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
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 9129
- 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
- 0
- Radical
- 1599
- Omega Function (Ω)
- 5
- 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
- 120
- 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
- a(n) = Sum_{k=1..n} floor((n/k) * floor((n/k) * floor(n/k))).at n=22A024922
- Numbers k that divide the (left) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=40A029488
- a(n) = (n-1)*(2*n-1)*(3*n-1).at n=14A033594
- Number of binary words of length n (beginning 0) with autocorrelation function 2^(n-1)+2.at n=17A045692
- a(n) = (2*n-1)*(5*n^2-5*n+6)/6.at n=20A063489
- Numbers n = concat(a,b) such that phi(n) = phi(a) * phi(b), where phi = A000010.at n=27A147619
- First trisection of A028560.at n=39A147651
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k double descents and initial descents (n>=0; 0<=k<=max(0,n-1)) [we say that i is a doubledescent of a permutation p if p(i) > p(i+1) > p(i+2); we say that a permutation p has an initial descent if p(1) > p(2)].at n=30A162976
- 41 times triangular numbers.at n=26A195038
- Degrees of irreducible representations of orthogonal group O8-(3).at n=16A214474
- Degrees of irreducible representations of orthogonal group O8-(3).at n=17A214474
- E.g.f.: Sum_{n>=0} d^n/dx^n (x + x^2)^(2*n) / (2*n)!.at n=6A215125
- -9-Knödel numbers.at n=45A225513
- Number of strict partitions of 2n + 1 having an ordering of the parts in which no two neighboring parts have the same parity.at n=34A239883
- Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 3.at n=10A244399
- Numbers k such that R_(k+2) + 3*10^k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=3A256927
- Numbers k such that k and k+1 both have 16 divisors.at n=40A274359
- Maximum value of the cyclic convolution of first n primes with themselves.at n=16A299111
- Number of partitions of n whose minimal excluded multiplicity is odd.at n=39A300183
- a(n) = Sum_{k=0..floor(n/3)} (n-k)!/(k! * (n-3*k)!).at n=12A358560