7314
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 15552
- Proper Divisor Sum (Aliquot Sum)
- 8238
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2288
- Möbius Function
- 1
- Radical
- 7314
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 119
- 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
- Number of distinct perforation patterns for deriving (v,b) = (n+2,n) punctured convolutional codes from (3,1).at n=4A007227
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BOG = Boggsite Na4Ca7[Al18Si78O192].74H2O starting with a T4 atom.at n=12A019080
- Convolution of odd numbers and A001950.at n=19A023659
- a(n) = Sum_{k=0..2*n-1} T(n,k) * T(n,k+1), with T given by A026584.at n=5A027283
- a(n) = (2*n - 1)*(3*n + 1).at n=35A033569
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=33A045940
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= sqrt(n).at n=21A048093
- Starting from generation 7 add previous and next term yielding generation 8.at n=16A048454
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=47A050049
- a(n) = smallest number m such that m and m+1 are the product of exactly n distinct primes.at n=3A052215
- Sum of a(n) terms of 1/k^(5/6) first exceeds n.at n=21A056181
- Smallest number m such that m*(m+1) has at least n distinct prime factors.at n=7A059958
- a(n) = Sum_{d|n} d*prime(d).at n=35A061150
- a(n) = binomial(n+5,4) - 1.at n=17A063258
- Squarefree kernel of (n*prime(n))*(n+prime(n)).at n=15A066197
- a(0) = 2 and, for n >= 1, rewrite 0->100 in the binary expansion of n and append 10 to the right.at n=24A080310
- Smaller of two consecutive numbers with the same prime signature not occurring earlier.at n=9A085929
- a(n) is the first term in the first chain of at least n consecutive numbers each having exactly four distinct prime factors.at n=1A087977
- Smaller of two consecutive numbers with the same prime signature not occurring earlier.at n=10A091405
- a(n) is the smallest number m such that each of the numbers m and m+1 has n distinct prime divisors.at n=3A093548