14838
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
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29688
- Proper Divisor Sum (Aliquot Sum)
- 14850
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4944
- Möbius Function
- -1
- Radical
- 14838
- 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
- 71
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n-k+1), where k = [n/2], s = (Lucas numbers).at n=14A025089
- McKay-Thompson series of class 10a for Monster.at n=10A058102
- Numbers which are the sum of their proper divisors containing the digit 4.at n=25A059463
- Numbers k such that k divides (prime(3*k) - prime(2*k)).at n=17A066893
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+9), n>=0.at n=6A067987
- Triangle, read by rows, that transforms diagonals in the table of coefficients of successive iterations of x+x^2+x^3 (cf. A166880).at n=21A166884
- Column 1 of triangle A166884.at n=6A166885
- a(0)=1, a(1)=2; thereafter a(n) = f(n-1) + f(n-2) where f() = A164387().at n=16A185265
- Number of n-node simple graphs having clique number 9.at n=11A205578
- Number of n-bead necklaces labeled with numbers -5..5 not allowing reversal, with sum zero.at n=5A208594
- T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero.at n=50A208597
- Number of 6-bead necklaces labeled with numbers -n..n not allowing reversal, with sum zero.at n=4A208600
- Numbers n such that n*7^n - 1 is prime.at n=5A242200
- Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=23A244244
- Irregular triangle read by rows: T(n,k) is the number of unordered pairs of nodes at distance k in the n-Apollonian network.at n=14A289722
- Number of subsets of {1,...,n + 1} containing n + 1 and such that all positive differences of distinct elements are distinct.at n=27A308251
- Number of integer partitions of n whose multiplicities all appear the same number of times.at n=47A325333
- a(n) is the surface area of the symmetric tower described in A221529 which is a polycube whose successive terraces are the symmetric representation of sigma A000203(i) (from i = 1 to n) starting from the top and the levels of these terraces are the partition numbers A000041(h-1) (from h = 1 to n) starting from the base.at n=21A345023
- a(n) = (1/3^n) * Sum_{k=0..n^3} ( (binomial(n^3, k) * 2^k) (mod 3^n) ).at n=30A376536