7310
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 14256
- Proper Divisor Sum (Aliquot Sum)
- 6946
- 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
- 2688
- Möbius Function
- 1
- Radical
- 7310
- 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
- yes
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 symmetrical planar partitions of n (planar partitions (A000219) that when regarded as 3-D objects have just one symmetry plane).at n=32A000784
- a(n) = (3*n+1)*(3*n+2).at n=28A001504
- a(n) = 2*n*(2*n-1).at n=43A002939
- Smallest positive number that can be written as sum of distinct Fibonacci numbers in n ways.at n=70A013583
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BEA = Beta Na7[Al7Si57O128] starting with a T9 atom.at n=12A019075
- Numbers whose set of base-13 digits is {3,4}.at n=19A032837
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=12A034587
- Number of basis partitions of n+25 with Durfee square size 5.at n=28A053800
- Numbers n such that [A070080(n), A070081(n), A070082(n)] is an isosceles integer triangle with integer area.at n=21A070145
- Numbers k such that [A070080(k), A070081(k), A070082(k)] is an obtuse integer triangle with integer area.at n=36A070147
- Squarefree numbers having exactly three prime gaps.at n=39A073489
- Deficient oblong numbers.at n=13A077804
- 4-almost primes equal to the product of two successive semiprimes.at n=27A108215
- n times n+4 gives the concatenation of two numbers m and m-6.at n=0A116248
- Engel expansion of cosh(1).at n=43A118239
- Number of base 6 n-digit numbers with adjacent digits differing by two or less.at n=6A126393
- Odious oblong (promic) numbers.at n=33A130201
- Difference between largest number of complexity n in the sense of A005245 and smallest number of complexity n in the sense of A005245.at n=24A133374
- A084175 interleaved with 2*A084175.at n=15A138477
- a(n) = n * A006218(n).at n=42A143274