4452
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 7644
- 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
- 1248
- Möbius Function
- 0
- Radical
- 2226
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 139
- 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
- Coordination sequence T2 for Zeolite Code DOH.at n=41A008079
- Number of partitions of n^2 into distinct squares.at n=37A030273
- Numbers k such that 33*2^k+1 is prime.at n=21A032366
- Every run of digits of n in base 11 has length 2.at n=37A033009
- Numbers whose base-3 representation contains exactly four 0's and no 1's.at n=24A044985
- Numbers whose base-3 representation contains exactly four 0's and four 2's.at n=3A045013
- Numbers whose base-4 representation contains exactly two 0's and four 1's.at n=33A045027
- a(n) = Sum_{i=0..floor(n/2)} A047080(n,i).at n=15A047082
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=34A050775
- Numbers n such that n | sigma_13(n).at n=14A055717
- Areas of a sequence of right-angled figures described below.at n=13A058195
- a(n) = floor(sqrt(Fibonacci(n+1)) - sqrt(Fibonacci(n))).at n=42A063595
- Triangle of number of permutations by length of shortest ascending run.at n=21A064315
- The concatenation of n with n-1 and n with n+1 both yield primes (twin primes).at n=38A068700
- a(n) = Sum_{i=0..floor(n/2)} (-1)^(i+floor(n/2))*T(2i+e), where T(n) are tribonacci numbers (A000073) and e = (1/2)(1-(-1)^n).at n=16A075111
- a(n) is the smallest number that is precisely n-tuply abundant.at n=44A081751
- a(n) = 4*Sum_{i=0..n-1} C(2*i+1, i)*C(n-1, n-1-i)*(-1)^(n-1-i)*2^i for n > 0, a(0) = 1.at n=5A085458
- Number of ways to split 1, 2, 3, ..., 6n into n arithmetic progressions each with 6 terms.at n=11A104432
- Sum of even-indexed terms of tribonacci numbers.at n=8A113300
- Number of permutations of length n which avoid the patterns 1423, 3124, 3421.at n=8A116749