5402
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8436
- Proper Divisor Sum (Aliquot Sum)
- 3034
- 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
- 2592
- Möbius Function
- -1
- Radical
- 5402
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 116
- 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
- a(n) = (3*n+1)*(3*n+2).at n=24A001504
- a(n) = 2*n*(2*n-1).at n=37A002939
- a(n) = 6*n^2 + 2 for n > 0, a(0)=1.at n=30A005897
- Coordination sequence T1 for Zeolite Code CAS.at n=44A008063
- Expansion of log(1+tan(x)*sinh(x)).at n=5A009378
- a(0) = 1, a(n) = 24*n^2 + 2 for n>0.at n=15A010014
- a(n) = floor(binomial(n,9)/9).at n=18A011855
- Numbers n such that n is a substring of its square when both are written in base 2.at n=45A018826
- a(n) = [ C(2n,n)/n ].at n=8A024498
- Triangle, T(n, k): T(n,k) = 1 for n < 3, T(3,1) = T(3,2) = T(3,3) = 2, T(n,0) = 1, T(n,1) = n-1, T(n,n) = T(n-1,n-2) + T(n-1,n-1), otherwise T(n,k) = T(n-1,k-2) + T(n-1,k-1) + T(n-1,k), read by rows.at n=74A026268
- a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 3, |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-3), where T is the array in A026268.at n=8A026289
- "BHK" (reversible, identity, unlabeled) transform of 1,0,1,0...(odds).at n=20A032089
- "BHK" (reversible, identity, unlabeled) transform of 0,1,1,1...at n=21A032090
- "BHK" (reversible, identity, unlabeled) transform of 2,1,1,1,...at n=9A032097
- Product of a prime and the following number.at n=20A036690
- Gaps of 7 in sequence A038593 (lower terms).at n=20A038653
- Numbers ending with '2' that are the difference of two positive cubes.at n=17A038857
- Denominators of continued fraction convergents to sqrt(507).at n=8A041969
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=31A045107
- Number of trees with n nodes and 4 leaves.at n=29A055291