7448
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
- 24
- Divisor Sum
- 17100
- Proper Divisor Sum (Aliquot Sum)
- 9652
- 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
- 266
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 3
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
- 39
- 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
- a(n) = (5^n - 3^n)/2.at n=6A005059
- Pisot sequence E(4,14): a(n) = floor(a(n-1)^2/a(n-2)+1/2) for n>1, a(0)=4, a(1)=14.at n=6A010904
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite ERI = Erionite (Na2,Ca..)3.5K2[Al9Si27O72].27H2O starting with a T1 atom.at n=5A019015
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite OFF = Offretite (Ca,Mg)1.5K[Al4Si14O36].14H2O starting from a T1 atom.at n=5A019044
- Every prefix prime in base 9 (written in base 9).at n=36A024769
- a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2n) = 6. Also a(n) = T(2n,n-2), where T is the array defined in A026009.at n=6A026014
- Number of n-digit numbers with maximal multiplicative persistence A014553.at n=7A046148
- Expansion of 1/((1+x)^7 - x^7).at n=10A049018
- T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=31A050162
- Numbers k such that sigma(k) - usigma(k) is a square and sets a new record for such squares.at n=18A063840
- Numbers k such that k = (sum of distinct prime factors of k)*(product of distinct prime factors of k).at n=35A068999
- Numbers k such that the k-th term of the EKG sequence (A064413(k)) has more than one controlling prime.at n=28A073735
- Numbers n such that sopf(phi(n)) = phi(sopf(n)), where sopf(x) = sum of the distinct prime factors of x.at n=26A076531
- Numbers k such that A000984(k) mod k = 0 and A080383(k) != 7.at n=34A080392
- Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x^2)^n.at n=55A084606
- Coefficient triangle of polynomials used for numerator of g.f.s for column sequences of array A078739.at n=29A089275
- Triangle read by rows, defined by T(n,k) = C(n,k)*S2(n,k), 0 <= k <= n, where C(n,k) are the binomial coefficients and S2(n,k) are the Stirling numbers of the second kind.at n=42A090683
- Numerator of Product_{k=0..n} ((2*k+1)/(2*k+2))^((-1)^t(k)) where t(k)=A010060(k) (Thue-Morse sequence).at n=13A094541
- Number of partitions of 2*n with no part divisible by 3 and all odd parts occurring with even multiplicities.at n=26A098151
- A Graham-Pollak-like sequence with cube root instead of square root.at n=33A100673