14056
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
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 16184
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- 0
- Radical
- 3514
- 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
- 58
- 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 switching networks with C(2,n) acting on domain and GL(3,Z2) acting on range.at n=2A000869
- Number of bipartite partitions.at n=16A002768
- a(n) = 2^(n-1) + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3).at n=15A005674
- Number of identity bracelets of n beads of 4 colors.at n=8A032241
- Number of 4-ary rooted trees with n nodes and height exactly 8.at n=15A036632
- Trajectory of 3 under map n->33n+1 if n odd, n->n/2 if n even.at n=12A037114
- Numerators of continued fraction convergents to sqrt(946).at n=6A042830
- f-amicable numbers where f(n) = n+1.at n=5A066505
- 30*a(n) is the gap between sexy prime triples in the n-th sexy prime triple triple whose initial term is 11.at n=11A090890
- Numbers k such that 7*10^k - 11 is prime.at n=19A102740
- Numbers k such that there is a bigger number m satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=29A124140
- Integers n such that 17+30*n are terms in A172456.at n=13A175103
- a(n) = 2*n*(9*n-1).at n=27A178574
- Triangle read by rows, based on expansion of (x^2/(exp(x)-1))^m = x^m+sum(n>m T(n,m)*m!/((n-m)!*n!)*x^n).at n=31A191578
- Triangle read by rows, based on expansion of (x^2*exp(x)/(exp(x)-1))^m = x^m + sum(n>m T(n,m)*m!/((n-m)!*n!)*x^n).at n=31A202995
- Principal diagonal of the convolution array A213844.at n=13A213845
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having two adjacent 1's and two adjacent 0's.at n=6A227438
- T(n,k) = Number of n X k 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X (k+1) binary array having two adjacent 1's and two adjacent 0's.at n=29A227442
- T(n,k) = Number of n X k 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X (k+1) binary array having two adjacent 1's and two adjacent 0's.at n=34A227442
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to either SmallGroup(2187,247)-#1;5 or SmallGroup(2187,247)-#1;9.at n=1A250242