14742
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
- 3
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 40656
- Proper Divisor Sum (Aliquot Sum)
- 25914
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3888
- Möbius Function
- 0
- Radical
- 546
- Omega Function (Ω)
- 7
- Little Omega Function (ω)
- 4
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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 45
- 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
- a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041).at n=27A000070
- Theta series of {E_6}* lattice.at n=32A005129
- Coordination sequence for 4-dimensional face-centered cubic orthogonal lattice.at n=13A008529
- Number of palindromic partitions of n.at n=54A025065
- Number of palindromic partitions of n.at n=55A025065
- Inverse Euler transform of primes.at n=34A030010
- Number of ternary Lyndon words whose digits sum to 1 (or 2) mod 3; number of trace 1 (or 2) monic irreducible polynomials over GF(3).at n=11A046211
- a(n) = (1)*(2 + 3 + 4 + ... + n) + (1 + 2)*(3 + 4 + 5 + ... + n) + (1 + 2 + 3)*(4 + 5 + 6 + ... + n) + ... + (1 + 2 + 3 + ... + n-1)*n.at n=12A067056
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=32A067355
- Longest cycle in range [A014137(n-1)..A014138(n-1)] of permutation A071661.at n=15A079439
- Numbers whose set of base 7 digits is {0,6}.at n=22A097253
- Number of partitions of n with at most one odd part.at n=55A100824
- Triangle read by rows: number of hex trees with n edges and k branches of length 1 (0<=k<=n).at n=36A126321
- Number of hex trees with n edges and no branches of length 1.at n=8A126322
- Number of partitions of n-set with 3 block sizes.at n=3A133118
- a(n) = 36*n^2 - 55*n + 21.at n=20A157262
- Number of nX4 1..4 arrays with all 1s connected, all 2s connected, all 3s connected, all 4s connected, 1 in the upper left corner, 2 in the upper right corner, 3 in the lower left corner, 4 in the lower right corner, and with no element having more than 2 neighbors with the same value.at n=12A164756
- Number of nondecreasing strings of numbers x(i=1..n) in -5..5 with sum x(i)^3 equal to 0.at n=17A188273
- Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.at n=19A208437
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w=x+y+z+n+2.at n=38A212252