5434
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 4646
- 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
- 2160
- Möbius Function
- 1
- Radical
- 5434
- Omega Function (Ω)
- 4
- 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
- 67
- 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
- yes
- Odd
- no
Appears in sequences
- Number of free planar polyenoids with n nodes and symmetry point group C_s.at n=11A000941
- Squares written in base 7.at n=43A002440
- Numerators of expansion of (1-x)^(-1/3).at n=8A004117
- Coordination sequence T1 for Zeolite Code SGT.at n=46A008229
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 5.at n=20A013593
- Powers of fifth root of 6 rounded down.at n=24A018129
- Powers of fifth root of 6 rounded to nearest integer.at n=24A018130
- Define the sequence S(a(0),a(1)) by a(n+2) is the least integer such that a(n+2)/a(n+1) > a(n+1)/a(n) for n >= 0. This is S(5,20).at n=5A022021
- n written in fractional base 6/5.at n=22A024638
- Distinct numbers seen when writing first numerator and then denominator of each element of 1/3-Pascal triangle (by row).at n=50A046541
- First numerator and then denominator of the elements to the right of the central elements of the 1/3-Pascal triangle (by row), excluding 1's and 3's.at n=44A046549
- Numerators of the elements to the right of the central elements of the 1/3-Pascal triangle (by row).at n=58A046551
- Even numbers in the numerators of the 1/3-Pascal triangle (by row).at n=47A046558
- Even numbers in the numerators of the 1/3-Pascal triangle (by row).at n=44A046558
- Distinct even numbers in the numerators of the 1/3-Pascal triangle (by row).at n=24A046559
- Distinct numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/3-Pascal triangle (by row).at n=44A046560
- Distinct even numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/3-Pascal triangle (by row).at n=19A046562
- Numbers n such that 71*2^n-1 is prime.at n=5A050561
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 6 skipped primes.at n=31A050773
- Number of nonsquare rectangles on an n X n board.at n=11A052149