4484
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8400
- Proper Divisor Sum (Aliquot Sum)
- 3916
- 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
- 2088
- Möbius Function
- 0
- Radical
- 2242
- Omega Function (Ω)
- 4
- 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
- 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
- Conway-Guy sequence: a(n + 1) = 2a(n) - a(n - floor( 1/2 + sqrt(2n) )).at n=14A005318
- Coordination sequence T4 for Zeolite Code MEL.at n=43A008153
- Coordination sequence T5 for Zeolite Code MTW.at n=44A008200
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=24A015990
- Continued fraction for log(77).at n=9A016505
- Numbers k such that k^2 is palindromic in base 3.at n=35A029984
- Numbers n > 99 with following property: form a sequence whose initial terms are the t digits of n, later terms given by rule b(i+1) = b(i) + product of t-1 previous terms; then n itself appears in the sequence.at n=5A042983
- a(n)=(s(n)+3)/9, where s(n)=n-th base 9 palindrome that starts with 6.at n=32A043077
- Numbers having three 4's in base 10.at n=24A043507
- Numbers whose base-4 representation has exactly 7 runs.at n=27A043598
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 7.at n=27A043843
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 8.at n=27A043857
- Numbers n such that number of runs in the base 4 representation of n is congruent to 7 mod 9.at n=27A043865
- Numbers k such that the number of runs in the base-4 representation of k is congruent to 7 (mod 10).at n=27A043874
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=20A058229
- Coefficients of replicable function number 49a.at n=51A058700
- Numbers n such that n | p(n)*q(n), where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).at n=36A060744
- Intrinsic 8-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=36A060878
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=24A065214
- Numbers n such that phi(n) + phi(n+1) = sigma(n)/2.at n=8A076647