13110
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 34560
- Proper Divisor Sum (Aliquot Sum)
- 21450
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3168
- Möbius Function
- -1
- Radical
- 13110
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 5
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 50
- 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 exterior points formed by extending diagonals of n-gon in general position.at n=17A005701
- a(n) = (-1 + prime(n+1)^2)/4.at n=48A024701
- Number of multiples of 3 in 0..2^n-1 with an even sum of base-2 digits.at n=16A036557
- Hexagonal matchstick numbers: a(n) = 3*n*(3*n+1).at n=38A045945
- Products of exactly 5 distinct primes.at n=37A046387
- Number of scalars which can be constructed from the Riemann tensor and metric tensor in n dimensions.at n=19A050297
- Number of asymmetric (identity) trees with n nodes and 7 leaves.at n=7A055338
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...at n=20A055992
- Numbers n such that sigma(n) = phi(prime(n)+1).at n=24A067625
- Numbers k such that sigma(k) = phi((prime(k)+prime(k+1))/2).at n=9A068365
- Numbers divisible by the sum of factorials of their digits [A061602(n)] and also terminate in the sum of factorials of their digits.at n=13A071064
- Nonsquares with A072594(n) = 0.at n=26A072596
- Squarefree kernel of (prime(n)+1)*(prime(n+1)+1)/4.at n=48A079093
- Squarefree numbers of the form (prime(k)+1)*(prime(k+1)+1)/4.at n=10A079095
- Expansion of g.f.: (1-2*x)*(1-4*x+x^2)/((1-x)*(1-3*x)*(1-4*x)).at n=8A087433
- Squarefree oblong (pronic) numbers having an odd number of prime factors.at n=18A098827
- Numbers k such that (6^k)*(2^k - 1) + 1 is prime.at n=10A098864
- First differences of A052911.at n=8A100059
- Numbers n such that 5*10^n + 4*R_n + 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=22A103016
- a(n) = n*(n+7)*(n+8)/6.at n=38A111396