4496
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 8742
- Proper Divisor Sum (Aliquot Sum)
- 4246
- 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
- 2240
- Möbius Function
- 0
- Radical
- 562
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 46
- 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
- E.g.f. exp(tanh(x)^2) (even powers only).at n=4A009277
- Number of partitions satisfying (cn(0,5) = cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=51A036821
- Numerators of continued fraction convergents to sqrt(481).at n=6A041918
- a(n) = n*(n^2 - 6*n + 11)/6.at n=32A050407
- 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.at n=32A051682
- Coefficients in expansion of Sum_{n >= 1} x^n/(1-x^n)^4.at n=29A059358
- Arithmetic derivative of (prime(n)+1)*(prime(n+1)+1)/4.at n=21A079094
- a(1)=1, a(2)=2; for n >= 2, a(n+1) = a(n) + sum of prime factors of a(n).at n=24A096461
- Numbers with semiprime digits (digits 4, 6, 9 only).at n=46A107665
- Numbers whose anti-divisors sum to a perfect cube.at n=12A109351
- 5-almost primes with semiprime digits (digits 4, 6, 9 only).at n=5A111697
- Number of distinct values taken by the entropy for permutations of [1..n], where the entropy of a permutation pi is Sum_{k=1..n} (pi(k)-k)^2.at n=30A126972
- a(n) = 5*n^2 + 10*n + 1. Coefficients of the rational part of (1 + sqrt(n))^5.at n=29A134593
- A Lucas-Binet triangle read by rows: t(n,m)=((( 1 + Sqrt[Prime[n]]))^m + (( 1 - Sqrt[Prime[n]]))^m)/2.at n=49A140895
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, 0, 1), (1, -1, 0), (1, 0, -1), (1, 1, -1)}.at n=8A148818
- Second right hand column of the Beta triangle A160480.at n=13A160483
- a(n) = Sum_{d|n} phi(n/d)^2*2^(d+1).at n=11A161217
- Numbers k with the property that the average digit of k^2 is 2.at n=25A164770
- The number of permutations p of {1,...,n} such that |p(i)-p(i+1)| is in {2,3,4,5} for all i from 1 to n-1.at n=8A174705
- Half the number of (n+1)X2 binary arrays with equal numbers of majority one 2X2 subblocks and majority zero 2X2 subblocks.at n=6A184459