7313
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7488
- Proper Divisor Sum (Aliquot Sum)
- 175
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7140
- Möbius Function
- 1
- Radical
- 7313
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 119
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- For any circular arrangement of 0..n-1, let S be the sum of cubes of every sum of two contiguous numbers; then a(n) is the number of distinct values of S.at n=14A008781
- Multiplicity of highest weight (or singular) vectors associated with character chi_137 of Monster module.at n=39A034525
- First differences give (essentially) A028242.at n=40A035107
- Number of partitions of n into parts not of the form 19k, 19k+9 or 19k-9. Also number of partitions with at most 8 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=33A035978
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=29A045276
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=28A053521
- a(n) = p(0) + p(1) + ... + p(n) - n - 1, where p = partition numbers, A000041.at n=24A058682
- a(n) = (n+1)*prime(n) + n*prime(n+1).at n=29A097240
- a(1)=3; a(n)=floor((20+sum(a(1) to a(n-1)))/6).at n=51A120180
- (n^3 - n + 15)/3.at n=27A155757
- Number of n X 4 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=17A166805
- Numbers that are the product of two distinct primes a and b, such that a^3+b^3 is the average of a twin prime pair.at n=25A176876
- Squarefree semiprimes k such that (m+1)^2-k is also a square, where m = ceiling(sqrt(k)).at n=34A180656
- Number of (n+1)X(n+1) 0..2 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=1A206216
- Number of (n+1)X3 0..2 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=1A206217
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with rows and columns of determinants of all 2X2 subblocks lexicographically nondecreasing.at n=4A206223
- Number of (2,0)-separable partitions of n; see Comments.at n=50A239482
- Indices of even terms in A249064.at n=31A249557
- Number of n X n nonnegative integer arrays with upper left 0 and lower right 2n-4 and value increasing by 0 or 1 with every step right or down.at n=4A252869
- Number of n X 5 nonnegative integer arrays with upper left 0 and lower right n+5-4 and value increasing by 0 or 1 with every step right or down.at n=4A252873