8470
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 10682
- 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
- 2640
- Möbius Function
- 0
- Radical
- 770
- 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
- 57
- 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
- Generating function = Product_{m>=1} 1/(1 - x^m)^2; a(n) = number of partitions of n into parts of 2 kinds.at n=17A000712
- Expansion of Product_{k>=1} (1 - x^k)^11.at n=38A010819
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MTW = ZSM-12 Nan[AlnSi28-nO56] starting with a T5 atom.at n=12A019195
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=39A060879
- First of triples of consecutive happy numbers, i.e., the first of three consecutive integers each of which is a happy number (A007770).at n=7A072494
- Nonsquares with A072594(n) = 0.at n=19A072596
- Numbers n such that sopf(sigma(n)) = sigma(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=21A076532
- a(n) = sum of terms in n-th row of A078448.at n=16A078449
- a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3.at n=19A079539
- a(n) = 1 + Sum(prime(i)*(2*i-1): 1<=i<=n).at n=15A083215
- Number of partitions of 2*n + 1 into parts of two kinds.at n=8A100535
- Numbers which when multiplied by any repunit prime Rp give a Smith number.at n=8A104167
- Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k UUDD's, where U=(1,1) and D=(1,-1) (0<=k<=floor(n/2), n>=2). A hill in a Dyck path is a peak at level 1.at n=40A105640
- Number of hill-free Dyck paths of semilength n, having no UUDD's, where U=(1,1) and D=(1,-1) (a hill in a Dyck path is a peak at level 1).at n=10A105641
- Triangle read by rows: T(n,k) = (k+1)(k+2)(n+2)(n+3)(6n^2 - 8n*k + 18n + 3k^2 - 11k + 12)/144 for 0<=k<=n.at n=42A107981
- Number of subsets of the first n numbers having a common divisor greater than 1.at n=25A109511
- Expansion of -(3 - x + 2*x^2) / (1 - x^3 + x^4).at n=49A110063
- a(n) = Product_{k=1..n} P(k), where P(k) is the smallest prime >= 2*k.at n=4A118748
- a(n) = n_{n^2}.at n=45A122625
- Composite numbers such that the square mean of their prime factors is a nonprime integer (where the prime factors are taken with multiplicity and the square mean of c and d is sqrt((c^2+d^2)/2)).at n=29A134602