4433
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5376
- Proper Divisor Sum (Aliquot Sum)
- 943
- 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
- 3600
- Möbius Function
- -1
- Radical
- 4433
- Omega Function (Ω)
- 3
- 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
- 139
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Mian-Chowla sequence (a B_2 sequence): a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise sums of elements are all distinct.at n=47A005282
- Coordination sequence T4 for Zeolite Code AET.at n=46A008010
- Coordination sequence T6 for Zeolite Code MFS.at n=41A008178
- q-Catalan numbers (binomial version) for q=4.at n=3A015034
- Number of squares on infinite chessboard at <= n knight's moves from a fixed square.at n=18A018836
- Least k such that k and 4k are anagrams in base n (written in base 10).at n=27A023096
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=20A024600
- Odd elements in 4-Pascal triangle A028275 (by row).at n=70A028277
- Odd elements in 4-Pascal triangle A028275 (by row) that are not 1.at n=45A028278
- Odd elements in 4-Pascal triangle A028275 (by row) that are not 1.at n=40A028278
- Distinct elements in 4-Pascal triangle A028275 (by row).at n=51A028280
- Distinct odd elements in 4-Pascal triangle A028275 (by row).at n=23A028281
- Elements to right of central elements in 4-Pascal triangle A028275.at n=58A028284
- Elements to right of central elements in 4-Pascal triangle A028275 that are not 1.at n=44A028285
- Odd elements (greater than 1) to right of central elements in 4-Pascal triangle A028275.at n=20A028287
- Numbers with digits 3 and 4 only.at n=26A032834
- Every run of digits of n in base 10 has length 2.at n=39A033008
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=47A034304
- Sums of 5 distinct powers of 4.at n=9A038473
- Numerators of continued fraction convergents to sqrt(19).at n=8A041028