9310
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 11210
- 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
- 3024
- Möbius Function
- 0
- Radical
- 1330
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 91
- 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
- 10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8*n - 5)/6.at n=19A007585
- a(n) = M(n) + m(n) for n >= 2, where M(n) = max{ a(i) + a(n-i): i = 1..n-1 }, m(n) = min{ a(i) + a(n-i): i = 1..n-1 }.at n=26A022905
- Number of compositions (ordered partitions) of n into powers of 2.at n=17A023359
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=36A023865
- a(n) = 49*(n-1)*(n-2)/2.at n=18A027469
- Number of partitions of n into parts not of the form 13k, 13k+6 or 13k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=37A035954
- Increasing gaps among twin primes: size.at n=42A036063
- A049031/2.at n=26A049032
- Numbers k such that sopfr(k) = sopfr(k + sopfr(k)).at n=15A050780
- Jordan function J_3(n).at n=21A059376
- Multiplicative with a(p^e) = 1 - p^3.at n=21A063453
- Multiplicative with a(p^e) = 1 - p^3.at n=43A063453
- Sum of all parts of all partitions of n.at n=19A066186
- a(n) = 3^n mod n^3.at n=40A066607
- Numbers k such that phi(k) divides (sigma(k+2) + sigma(k-2)).at n=45A067245
- Indices of prime Fibonacci numbers, minus 1.at n=24A069744
- Sum of squares of digits of n is equal to the largest prime factor of n reversed, where the largest prime factor is not a palindrome.at n=15A074303
- Number of groups of order 3^n.at n=7A090091
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=43A101243
- a(1) = 932; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1).at n=23A105213