5369
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6720
- Proper Divisor Sum (Aliquot Sum)
- 1351
- 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
- 4176
- Möbius Function
- -1
- Radical
- 5369
- 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
- 72
- 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
- a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=12A000441
- 4-dimensional figurate numbers: a(n) = (5*n-1)*binomial(n+2,3)/4.at n=12A002418
- Wolstenholme numbers: numerator of Sum_{k=1..n} 1/k^2.at n=5A007406
- Coordination sequence T1 for Zeolite Code VNI.at n=45A009907
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite AFR = SAPO-40 [Si7Al29P28O128].4TPA.OH starting with a T3 atom.at n=5A018962
- a(n) = Sum_{0 <= i < j <= n} (prime(j) - prime(i))^2, where prime(0) = 1.at n=8A024526
- Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=30A028268
- Elements to right of central elements in 3-Pascal triangle A028262 that are not 1.at n=51A028272
- Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=28A028274
- Numbers k such that 245*2^k+1 is prime.at n=21A032499
- Numbers k such that if d,e are consecutive digits of k in base 6, then |d-e| >= 4.at n=35A032988
- a(n) = (2*n - 1)*(3*n + 1).at n=30A033569
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=16A052049
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A074339
- a(n) = n*(n+1)^2*(2+n)*(3+2*n)*(19+8*n)/180.at n=5A076758
- Matrix product of Stirling1-triangle A008275(n,k) and unsigned Lah-triangle |A008297(n,k)|.at n=31A079639
- a(1) = 4 and then least composite such that every partial concatenation of 2 or more terms is a prime.at n=39A086474
- a(n) = A000217(A000217(n))-n^2.at n=14A086602
- Tetranacci numbers starting with first four cubes.at n=10A093322
- Numbers which are numerators of at least one reduced rational sum{k=1 to m} 1/k^n, taken over all positive integers m and n.at n=24A094509